A New Metaheuristic Algorithm for Large Graph Coloring Problems
The Graph Coloring Problem (GCP) is an NP-hard combinatorial optimization problem that involves assigning colors to the vertices of a graph such that no two adjacent vertices share the same color. Due to its computational complexity, exact algorithms are often impractical for solving large-scale instances within reason...