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

Abstract

In this paper, the problem of connectivity of patchy conservation s11es was approac/1ed by the use of graph theory. Determination of /he so-called core s11es was subsequenf/y conducted by establishing /he cover areas formula/ed in the framework of integer linear programming, connecting the unconnected cover areas by applica/ion of Dijks/ra algonthm and h"euristically pruning the unused covers lo secure the mm1mum connec/ed cover ,,,. eas. An illustrative example of this method descr1bes the wildlife conserva/ion 111 Sumalra. The connectivity proble1n of '.211 districts in:: .Provinces of Ja111b1. R1au and West Sun1atra inhabited by 111 species of wildlife were considered.