|
|
|
|
|
|
|
Connectivity in the design of protected area networks
|
| |
| |
|
Description: |
A number of problems associated with the spatial structure in the design of networks of protected areas are not trivial, and solutions are not readily approximated intuitively. One such issue is that of identifying networks capturing the regional species assemblage, where some level of adjacency or connectivity between areas is achieved. These spatial issues fit within the framework of graph theory. I will address three different problems concerning connectivity in the design of protected areas for conservation.
Area(s):
|
|
Date: |
|
| Start Time: |
14:30 |
|
Speaker: |
Jorge Orestes Cerdeira
(Dep. Matemática, Inst. Sup. Agronomia)
|
|
Place: |
Room 2.4
|
| Research Groups: |
-Numerical Analysis and Optimization
|
|
See more:
|
<Main>
|
|
| |
|
|
|
|
|
|
© 2012 Centre for Mathematics, University of Coimbra, funded by
Powered by: rdOnWeb
v1.4 | technical support
|
|
|
|
