Implementation of Graph Colouring Using Welch-Powell Algorithm to Determine Student Mentoring Schedule
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 t...
Gespeichert in:
Veröffentlicht in: | Jurnal Theorems (The Original Research of Mathematics) 2019-07, Vol.4 (1) |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | ind |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
ISSN: | 2528-102X 2541-4321 |
DOI: | 10.31949/th.v4i1.1317 |