A graph theory approach for designing conservation reserve networks with minimal fragmentation
From MaRDI portal
Publication:5449669
DOI10.1002/NET.20211zbMATH Open1180.90035OpenAlexW4237408903MaRDI QIDQ5449669FDOQ5449669
Publication date: 12 March 2008
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20211
Cites Work
Cited In (8)
- Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach
- Solving Connected Subgraph Problems in Wildlife Conservation
- Achieving full connectivity of sites in the multiperiod reserve network design problem
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences
- Optimal design of compact and functionally contiguous conservation management areas
- Solving Steiner trees: Recent advances, challenges, and perspectives
- Budgeted nature reserve selection with diversity feature loss and arbitrary split systems
- A new method to solve the fully connected reserve network design problem
Recommendations
- Title not available (Why is that?) 👍 👎
- Achieving full connectivity of sites in the multiperiod reserve network design problem 👍 👎
- Solving Connected Subgraph Problems in Wildlife Conservation 👍 👎
- ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem 👍 👎
- Wildlife corridors as a connected subgraph problem 👍 👎
- Title not available (Why is that?) 👍 👎
- A fragmented model for the problem of land use on hypergraphs 👍 👎
- Connectivity-splitting models for survivable network design 👍 👎
- Designing low-congestion networks with structural graph theory 👍 👎
This page was built for publication: A graph theory approach for designing conservation reserve networks with minimal fragmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449669)
