Course Scheduling Using the Malatya Coloring Algorithm

The problem of course scheduling has attracted the attention of researchers since the second half of the 20th century, and studies with developing technology have led to significant developments in this field. Manual scheduling is a time-consuming and challenging process; therefore, various algorithms have been developed. In this paper, a solution to the course scheduling problem is presented using the Malatya Coloring Algorithm. The algorithm is implemented in two steps: first, the centrality values of the nodes are calculated, then the node with the highest centrality value is selected and colored. In the scheduling process, the aim is to avoid course conflicts and to create the best schedule that meets the constraints. Malatya Coloring algorithm is notable for its ability to predict all the steps and provide a solution in polynomial time