Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...

This project implements six graph coloring algorithms — ranging from simple greedy heuristics to a customized, improved Genetic Algorithm (GA). The goal is to show how heuristic design strongly ...

Abstract: The graph coloring problem is an important problem with many known applications, but it is not realistic to apply the exact algorithms to large graphs. Therefore, heuristics are used in many ...