Downloads: 1 | Views: 239 | Monthly Hits: ⮙1

Research Paper | Mathematics | India | Volume 11 Issue 3, March 2022 | Popularity: 4.7 / 10

Rate This Article!      

A Wide Classification of Graph Vertex Coloring

Dr A. Sri Krishna Chaitanya, Dr P. Srilakshmi

Abstract: 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.

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

Edition: Volume 11 Issue 3, March 2022

Pages: 939 - 941

DOI: https://www.doi.org/10.21275/SR22316210936

Make Sure to Disable the Pop-Up Blocker of Web Browser

Click to Cite this Article

Similar Articles