Application of the Greedy Algorithm for Graph Coloring of the Grobogan Regency Map: Application of the Greedy Algorithm for Graph Coloring of the Grobogan Regency Map

Ade Ima Afifa Himayati; Muhammad Adib Jauhari Dwi Putra; Erik Maurten Firdaus; Muhammad Faudzi Bahari

doi:10.29303/emj.v5i2.149

Authors

Ade Ima Afifa Himayati Universitas Muhammadiyah Kudus
Muhammad Adib Jauhari Dwi Putra Universitas Muhammadiyah Kudus
Erik Maurten Firdaus Universitas Muhammadiyah Kudus
Muhammad Faudzi Bahari Universitas Muhammadiyah Kudus

DOI:

https://doi.org/10.29303/emj.v5i2.149

Keywords:

Coloring Area, Greedy Algoritm

Abstract

The district map in Grobogan Regency can be optimized using the Greedy algorithm. The point on the graph represents the district and the line represents two areas that are directly adjacent. Greedy Algorithm is one of the algorithms developed to solve the problem of graph coloring to be able to produce minimal colors that are used without having the same color in areas that are directly adjacent. Greedy’s algorithm uses a set of color candidates and solutions in its solution. Staining is done at the point with the greatest degree followed by an examination of the appropriateness of the color with the principle that no neighboring points have the same color. The resulting color is included in the solution set. The process is continued until all the dots have been colored. Regional coloring in Grobogan district produces four colors with a greedy algorithm as the minimum color solution obtained

References

Ammar, M. (2019). Implementasi Algoritma Sequential dan Welch Powell pada pewarnaan graf (studi kasus pewarnaan peta kota Makassar). Jurnal Varian, 3(1), 28–35. https://doi.org/10.30812/varian.v3i1.488

Bustan, A. W., & Salim, M. R. (2019). Penerapan Pewarnaan Graf Menggunakan Algoritma Welch Powell untuk Menentukan Jadwal Bimbingan Mahasiswa. Jurnal THEOREMS (The Original Research of Mathematics), 4(1), 79–86.

Diestel, R. (2000). Graduate Texts in Mathematics, Volume 173. Springer-Verlag New York, Incorporated.

Golumbic, M. C. (2018). Total coloring of rooted path graphs. Information Processing Letters, 135,73–76. https://doi.org/10.1016/j.ipl.2018.03.002

Himayati, A. I. A., Alfiana, K., Putra, M. A. J. D., & Utami, R. (2020). Aplikasi Pewarnaan Graf Dengan Metode Welch Powell Pada Pembuatan Jadwal Ujian Proposal Skripsi Program Studi Farmasi Universitas Muhammadiyah Kudus Ade Ima Afifa Himayati. Jurnal Ilmu Komputer Dan Matematika, 1(1), 32–39.

Maftukhah, U., Amiroch, S., & Pradana, M. S. (2020). Implementasi Algoritma Greedy Pada Pewarnaan Wilayah Kecamatan Sukodadi Lamongan. Unisda Journal of Mathematics and Computer Science (UJMC), 6(2), 29–38. https://doi.org/10.52166/ujmc.v6i2.2391

Munir, R. (2010). Matematika Diskrit Revisi Keempat. Informatika Bandung, Bandung.

Rahadi, A. P. (2019). Penjadwalan Mata Kuliah Menggunakan Pewarnaan Graf Dengan Algoritma Largest First. Jurnal Padegogik Matematika,2(1),1–13. https://doi.org/10.35974/jpd.v2i1.1067

Rosen, K.H. 2019. Discreate Mathematics and Its Applications Eighth Edition.McGraw-Hill Education, New York

Zalfa Jofie, M., Bahri, S., & Iqbal Baqi, A. (2021). Aplikasi Algoritma Greedy Untuk Pewarnaan Wilayah Pada Peta Kota Padang Berbasis Teorema Empat Warna. Jurnal Matematika UNAND,9(4),294. https://doi.org/10.25077/jmu.9.4.294-301.2020

An Application of Greedy Algorithm in Grobongan District Map Coloring