Pewarnaan Graf Dalam Penentuan Jadwal Ujian Mahasiswa (Studi Kasus Prodi Teknik Informatika Unwidha)
Abstract
Often, scheduling final-year student exams becomes a problem within the scope of study programs, one of which is the Informatics Engineering study program at Widya Dharma University, Klaten. This is because the schedule of each examining lecturer is not the same, and besides that, the space available also varies every day. There are several alternative algorithms that can be used to solve scheduling problems, one of which is graph coloring. Graph coloring can include points, lines, and areas. In this research, researchers will try to divide student exam schedules using dot coloring, where the dot coloring algorithm used is Welch Powel The Welch Powell algorithm is the most frequently used graph coloring algorithm. This algorithm starts by sorting the degrees of the graph from largest to smallest, then assigns a color to the vertex at the largest vertex and assigns a different color to the vertices below that are not adjacent to that vertex. Keywords: Welch-Powell algorithm, graph, graph coloring.
References
[2] K. Harianto, “Modifikasi Algoitma Welch-Powell untuk Optimalisasi Pendjadwalan Ujian Skripsi,” J. Teknol. dan Sist. Inf., vol. 2, no. 1, hal. 119–128, 2017.
[3] R. Syam, H. Ihsan, dan A. Asman, “Aplikasi Pewarnaan Graf dengan Algoritma Recursive Largest First pada Penjadwalan Mata Kuliah,” J. Math. Comput. Stat., vol. 2, no. 1, hal. 63, 2020, doi: 10.35580/jmathcos.v2i1.12461.
[4] A. H. Fransiskus Fran, “Pewarnaan Simpul, Sisi, Wilayah Pada Graf Dan Penerapannya,” Bimaster Bul. Ilm. Mat. Stat. dan Ter., vol. 8, no. 4, hal. 773–782, 2019, doi: 10.26418/bbimst.v8i4.36037.
[5] C. Angga dan R. Munir, “Pengembangan Algoritma Greedy Untuk Optimalisasi Penataan Peti Kemas Pada Kapal Pengangkut,” J. Sarj. Inst. Teknol. Bandung, 2012.
[6] M. Lipschutz, Seymour & Lipson, Theory and Problems of Discreate Mathematics. United States: McGraw-Hill, 2007.
[7] L. S. Lestari dan Mulyono, “Penerapan Algoritma Welch-Powell Pada Pewarnaan Graf Dalam Pemetaanwilayah di Kota Medan,” Karimatika, vol. 6, no. 1, hal. 17–28, 2020.
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish in UJMC (Unisda Journal of Mathematics and Computer Science) agree to the following terms:
1.Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (CC BY-SA 4.0) that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
2.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
3.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
