Vertex coloring is a well probed problem in graph theory. The problem of graph coloring is known to be NP-complete problem. Such NP complete problems can easily be solved with the help of distributed ...

About A Comparison between a Genetic Algorithm and the Hill Climbing Algorithm for the Vertex Graph Coloring problem ...