| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 493356 | Procedia Technology | 2012 | 6 Pages |
Abstract
Graph coloring is an important problem with its wide variety of applications. The problem is NP-hard in nature and no polynomial time algorithm is known for it. In this paper, we propose a new method for graph coloring. The proposed scheme is efficient with respect to simplicity, robustness and computation time.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
