The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Planar 3-colorability is polynomial complete
ACM SIGACT News
Improving the performance guarantee for approximate graph coloring
Journal of the ACM (JACM)
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Computational limitations on learning from examples
Journal of the ACM (JACM)
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
| Hi-index | 0.00 |
Let A be a graph coloring algorithm. Denote by -&-Agrave; (G) the ratio between the maximum number of colors A will use to color the graph G, and the chromatic number of G,x(G). For most existing polynomial coloring algorithms, -&-Agrave;(G) can be as bad as O(n), where n is the number of vertices in G. The best currently known algorithm guarantees -&-Agrave; (G)-&-equil;O(n/logn). In this paper we present a simple and efficient coloring algorithm which guarantees -&-Agrave;(G)-&-le;x(G)n (equation), a considerable improvem-&-edot;nt over the current bounds.