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

Please use this identifier to cite or link to this item: http://repository.ipb.ac.id/handle/123456789/75756

Full metadata record

DC Field	Value	Language
dc.contributor.author	Hanum, Farida
dc.contributor.author	Wahyuni, Nur
dc.contributor.author	Bakhtiar, Toni
dc.date.accessioned	2015-07-02T02:27:36Z
dc.date.available	2015-07-02T02:27:36Z
dc.date.issued	2014
dc.identifier.issn	0973-7537	-
dc.identifier.uri	http://repository.ipb.ac.id/handle/123456789/75756
dc.description.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.	en
dc.language.iso	id
dc.relation.ispartofseries	Volume. 35,;Issue No. 4; Year 2014	-
dc.title	Connectivity Problem of Wildlife Conservation in Sumatra: A Graph Theory Application	en
dc.type	Article	en
dc.subject.keyword	Connectivity problem	en
dc.subject.keyword	covering·connecting-pruning	en
dc.subject.keyword	Dijkstra algorithm	en
dc.subject.keyword	wildlife conservation	en
dc.subject.keyword	Sumatra	en
Appears in Collections:	Faculty of Mathematics and Natural Sciences

Files in This Item:

File	Description	Size	Format
ART2014_fha.pdf	Fulltext	439.74 kB	Adobe PDF	View/Open

DSpace JSPUI