ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

A Wide Classification of Graph Vertex Coloring

Journal: International Journal of Science and Research (IJSR) (Vol.11, No. 3)

Publication Date:

Authors : ; ;

Page : 939-941

Keywords : Coloring; Graphs; complete heuristic; recombination; configuration;

Source : Downloadexternal Find it from : Google Scholarexternal


Graph vertex coloring is one of the most studied NP-hard combinatorial optimization problems. Given the hardness of the problem, various heuristic algorithms have been proposed for practical graph coloring, based on local search, population-based approaches and hybrid methods. The research in graph coloring heuristics is very active and improved results have been obtained recently, notably for coloring large and very large graphs. This chapter surveys and analyzes graph coloring heuristics with a focus on the most recent advances.

Last modified: 2022-05-14 21:02:36