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

Abstract

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 Djikstra 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.