This project implements a Genetic Algorithm (GA) to solve the Graph Coloring Problem, where the goal is to assign colors to the vertices of a graph such that no two adjacent vertices share the same ...

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 ...

A C++ implementation that solves the graph coloring problem using the Pagmo2 library's simulated annealing algorithm. The graph coloring problem is a classic NP-hard optimization problem where the ...

Graph colouring is a fundamental problem in both theoretical and applied combinatorics, with significant implications for computer science, operational research and network theory. At its essence, ...