Open Access Open Access  Restricted Access Subscription or Fee Access

Connectivity Problem of Wildlife Conservation in Sumatra: A Graph Theory Application

Farida Hanum, Nur Wahyuni, Toni Bakhtiar


In this paper, the problem of connectivity of patchy conservation sites was approached by the use of graph theory. Determination of the so-called core sites was subsequently conducted by establishing the cover areas formulated in the framework of integer linear programming, connecting the unconnected cover areas by application of Dijkstra algorithm and heuristically pruning the unused covers to secure the minimum connected cover areas. An illustrative example of this method describes the wildlife conservation in Sumatra. The connectivity problem of 20 districts in 3 provinces of Jambi, Riau and West Sumatra inhabited by 10 species of wildlife were considered.


Connectivity problem, covering-connecting-pruning, Dijkstra algorithm, wildlife conservation, Sumatra

Full Text:


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.