Variations on Memetic Algorithms for Graph Coloring Problems

Laurent Moalic, Alexandre Gondran

Graph vertex coloring with a given number of colors is a well-known and much-studied NP-complete problem.The most effective methods to solve this problem are proved to be hybrid al…