A Wide Classification of Graph Vertex ColoringJournal: International Journal of Science and Research (IJSR) (Vol.11, No. 3)
Publication Date: 2022-03-05
Authors : Dr A. Sri Krishna Chaitanya; Dr P. Srilakshmi;
Page : 939-941
Keywords : Coloring; Graphs; complete heuristic; recombination; configuration;
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.
Other Latest Articles
Last modified: 2022-05-14 21:02:36