Graph Coloring Algorithm for Course Time Table Scheduling Problem

The purpose of this paper is to prepare a course time table by introducing a proposed algorithm based on known heuristic graph coloring algorithms, namely the Welch Powel algorithm and the saturation degree ordering algorithm, which found a better and optimal solution. The proposed algorithm will be used to solve the course time table scheduling problem which is formulated by converting the problem into a graph where subjects will be concede as vertices of graph.