An exact algorithm with learning for the graph coloring problem

@article{Zhou2014AnEA,
  title={An exact algorithm with learning for the graph coloring problem},
  author={Zhaoyang Zhou and Chu Min Li and Chong Huang and Ruchu Xu},
  journal={Computers & OR},
  year={2014},
  volume={51},
  pages={282-301}
}
Given an undirected graph G=(V ,E), the Graph Coloring Problem (GCP) consists in assigning a color to each vertex of the graph G in such a way t h t any two adjacent vertices are assigned different colors, and the number of different colors used is minimized. State-of-the-art algorithms generally deal with the explicit constraints in GCP: any two adjacent vertices should be assigne d diff rent colors, but do not specially deal with the implicit constraints between no -adjacent vertices implied… CONTINUE READING