Implementation of Graph Colouring Using Welch-Powell Algorithm to Determine Student Mentoring Schedule

Ariestha Widyastuty Bustan, M Rais Salim

Abstract


Graph colouring using the Welch-Powell algorithm is one of the schedule preparation techniques. Especially for arranging student guidance schedules in a study program. The vertex on a graph is represented as a student who will conduct guidance, while the side that connects two vertex states if the two vertex or two students have one and/or two of the same supervisors. The results of this research indicate that the coloring of graphs using the Welch Powell algorithm can be applied to compile the guidance schedule of PGSD students at the Pacific University of Morotai.


Full Text:

PDF

References


Astuti, S. (2011). Penyusunan Jadwal Ujian Mata Kuliah Dengan Algoritma Pewarnaan Graf Welch Powell. Jurnal Dian, 11(1).

Harianto, K., & Fatdha, T. S. E. (2016). Penerapan Pewarnaan Simpul Graf untuk Menentukan Jadwal Ujian Skripsi pada STMIK Amik Riau Menggunakan Algoritma Welch-Powell. SATIN-Sains dan Teknologi Informasi, 1(2), 48-54.

Diestel, R. (2010). Graph Theory 4th edition. Springer.

Munir, R. (2012). Matematika Diskrit Revisi Kelima. Indformatika, Bandung.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

Indexed by:

                                      

 

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Location: