A Survey on Heuristic Graph Coloring Algorithm |
Author(s): |
| Akanksha Gupta , Lakshmi Narain College of Technology,Indore; Harish Patidar, Lakshmi Narain College of Technology,Indore |
Keywords: |
| Graph Coloring Problem, Approximate Algorithm, Heuristic Algorithm |
Abstract |
|
The problem of graph coloring is to assign color to all the vertices such that no neighbor vertices have same color. This is known as vertex coloring. Graph coloring problem belongs to the class of NP-hard problem. There are many real world applications in which the concept of graph coloring is used. There are certain approaches to implement the graph coloring algorithms. This paper gives certain heuristic graph coloring algorithms comparison in term of runtime and number of colors used. |
Other Details |
|
Paper ID: IJSRDV4I40382 Published in: Volume : 4, Issue : 4 Publication Date: 01/07/2016 Page(s): 297-301 |
Article Preview |
|
|
|
|
