Search
Now showing items 1-1 of 1
The Study of Vertex Coloring Algorithms Using Heuristic Approaches
(Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
Graph vertex coloring is one of the most studied NP-complete optimization problem (READ, 1972) [2]. The problem is that; given a graph G, determine the number of colors required to color G, so that no two adjacent vertices ...