Record Details

Implementasi Algoritma Greedy Pada Pewarnaan Wilayah Kecamatan Sukodadi Lamongan

Unisda Journal of Mathematics and Computer Science (UJMC)

View Archive Info
 
 
Field Value
 
ISSN 2579-907X
2460-3333
 
Authentication Code dc
 
Title Statement Implementasi Algoritma Greedy Pada Pewarnaan Wilayah Kecamatan Sukodadi Lamongan
 
Added Entry - Uncontrolled Name Maftukhah, Umi
Amiroch, Siti
Pradana, Mohammad Syaiful
Universitas Islam Darul 'Ulum Lamongan
Universitas Islam Darul 'Ulum Lamongan
Universitas Islam Darul 'Ulum Lamongan
 
Summary, etc. Graph theory can be applied in various fields of science such as transportation problems, communication networks, operations research, chemistry, cartography and so on. Graph theory does not only represent structure but in its application, a graph can also be colored. Many problems have graph coloring characteristics such as regional coloring. This regional coloring theory was applied to the map area of ​​Sukodadi District which consists of 20 villages. In this area coloring uses the Greedy algorithm by first making a dual graph consisting of 20 vertices and 43 edges. Based on the results of regional coloring, the minimum number of colors is 4, namely red, blue, green and yellow, with each neighboring village having a different color.
 
Publication, Distribution, Etc. Mathematics Department of Mathematics and Natural Sciences Unisda Lamongan
 
Electronic Location and Access application/pdf
http://e-jurnal.unisda.ac.id/index.php/ujmc/article/view/2391
 
Data Source Entry Unisda Journal of Mathematics and Computer Science (UJMC); Vol 6 No 2 (2020): Unisda Journal of Mathematics and Computer science
 
Language Note eng
 
Terms Governing Use and Reproduction Note ##submission.copyrightStatement##