A Generalized Implicit Enumeration Algorithm for Graph Coloring.
Saved in:
| Title: | A Generalized Implicit Enumeration Algorithm for Graph Coloring. |
|---|---|
| Authors: | Horowitz, Ellis, Kubale, Marek1, Jackowski, Boguslaw2 |
| Source: | Communications of the ACM. Apr1985, Vol. 28 Issue 4, p412-418. 7p. 1 Chart, 2 Graphs. |
| Subjects: | Algorithms, Graph coloring, Graph theory, Backtrack programming, Computer programming, Sequential analysis |
| Abstract: | A generalized algorithm for graph coloring by implicit enumeration is formulated. A number of backtracking sequential methods are discussed in terms of the generalized algorithm. Some are revealed to be partially correct and inexact. A few corrections to the invalid algorithms, which cause these algorithms to guarantee optimal solutions, are proposed. Finally, some computational results and remarks on the practical relevance of improved implicit enumeration algorithms are given. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
