2000
DOI: 10.1556/comec.1.2000.1.12
|View full text |Cite
|
Sign up to set email alerts
|

Quantifying the network connectivity of landscape mosaics: a graph-theoretical approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
46
0
3

Year Published

2007
2007
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 92 publications
(49 citation statements)
references
References 25 publications
0
46
0
3
Order By: Relevance
“…The most used method in landscape ecology is the graph theory that allows the representation and assessment of landscape connectivity (Ricotta et al 2000, Urban & Keitt 2001, Pascual-Hortal & Saura 2006. The graph theory method enables landscape representation as an interconnected network of patches (Ricotta et al 2000), the basic components of the net-work being the number of habitat patches (N) or nodes and links (L) or connecting elements (Saura & Hortal 2007, Saura & Rubio 2010. Our research proposes an evaluation of the effectiveness of Natura 2000 network in Romanian Alpine Biogeographical Region, analysing the connectivity of the protected forest surfaces, on the one hand, and for the whole forest surfaces (protected and unprotected), on the other hand.…”
Section: Manuscript Received Februarymentioning
confidence: 99%
“…The most used method in landscape ecology is the graph theory that allows the representation and assessment of landscape connectivity (Ricotta et al 2000, Urban & Keitt 2001, Pascual-Hortal & Saura 2006. The graph theory method enables landscape representation as an interconnected network of patches (Ricotta et al 2000), the basic components of the net-work being the number of habitat patches (N) or nodes and links (L) or connecting elements (Saura & Hortal 2007, Saura & Rubio 2010. Our research proposes an evaluation of the effectiveness of Natura 2000 network in Romanian Alpine Biogeographical Region, analysing the connectivity of the protected forest surfaces, on the one hand, and for the whole forest surfaces (protected and unprotected), on the other hand.…”
Section: Manuscript Received Februarymentioning
confidence: 99%
“…transport, communication and information networks, etc.) only some graph-based ecological applications tackling conservation problems have been recently reported (Keitt et al 1997;Bunn et al 2000;Ricotta et al 2000;Urban and Keitt 2001;Jordan et al 2003;Pascual-Hortal and Saura 2006). In graph theory, a graph is a set of nodes (or vertices) and links (or edges) such that each link connects two nodes.…”
Section: Graph Theorymentioning
confidence: 99%
“…Although there is a wide variety of connectivity indices in the literature (Hanski 1994;Bunn et al 2000;Ricotta et al 2000;Urban and Keitt 2001;Moilanen and Nieminen 2002;Jordan et al 2003;Calabrese and Fagan 2004), many of them have been found to present serious limitations that make them inadequate for effectively integrating connectivity in forest conservation planning (Pascual-Hortal and Saura 2006). Also, the spatial scales traditionally considered in forest management should be broaden to adequately characterize connectivity, which occurs at a landscape scale (Merriam 1984;Wiens et al 1997;Tischendorf and Fahring 2000;Raison et al 2001).…”
Section: Introductionmentioning
confidence: 99%
“…The 316 greater the mean eccentricity of the graph nodes, the more elongated the topology of the 317 sampling design. In preliminary analyses, we had quantified the topology by other graph 318 theoretic measures (Harary index, degree centrality, betweenness centrality, closeness 319 centrality) (Minor & Urban 2008;Ricotta et al 2000), but these measures were rather strongly 320 associated (mostly linearly) with each other, therefore we used only the mean eccentricity in 321 the main analysis. 322 323 Random sampling and the subsequent analysis process described above was iterated 400 324 times at every sample size level, which resulted in a total of 1600 (4 sample sizes × 400 325 repetitions) unique sampling designs and variation partitioning analyses.…”
mentioning
confidence: 99%