Heuristic Algorithm for Graph Coloring Based On Maximum Independent Set
A number of heuristic algorithms have been developed for the graph coloring problem, but unfortunately, on any given instance, they may produce colorings that are very far from optimal. In this paper we investigated and introduce a three heuristics algorithm to color a graph based on a maximum indep...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Stefan cel Mare University of Suceava
2012-01-01
|
| Series: | Journal of Applied Computer Science & Mathematics |
| Subjects: | |
| Online Access: | http://jacs.usv.ro/getpdf.php?paperid=13_3 |