Abstract
Let A be a graph coloring algorithm. Denote by Â(G) the ratio between the maximum number of colors A will use to color the graph C, and the chromatic number of G, χ(G). For most existing polynomial coloring algorithms, Â(G) can be as bad as O(n), where n is the number of vertices in G. The best currently known algorithm guarantees Â(G)-O(n/log n). In this paper we present a simple and efficient coloring algorithm which guarantees Â(G)≤χ(G)n1-1/χ(G)-1, a considerable improvement over the current bounds.
Original language | English |
---|---|
Title of host publication | Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC 1982 |
Publisher | Association for Computing Machinery |
Pages | 325-329 |
Number of pages | 5 |
ISBN (Print) | 0897910702 |
DOIs | |
State | Published - 5 May 1982 |
Externally published | Yes |
Event | 14th Annual ACM Symposium on Theory of Computing, STOC 1982 - San Francisco, United States Duration: 5 May 1982 → 7 May 1982 |
Publication series
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
ISSN (Print) | 0737-8017 |
Conference
Conference | 14th Annual ACM Symposium on Theory of Computing, STOC 1982 |
---|---|
Country/Territory | United States |
City | San Francisco |
Period | 5/05/82 → 7/05/82 |
Bibliographical note
Publisher Copyright:© 1982 ACM.