Proceedings Article10.1145/800070.802207
A new approximate graph coloring algorithm
Avi Wigderson
- 05 May 1982
- pp 325-329
25
TL;DR: A simple and efficient coloring algorithm which guarantees-&-Agrave; (G)-&-le;x(G)n</italic> (equation), a considerable improve over the current bounds is presented.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Cryptographic limitations on learning Boolean formulae and finite automata
Michael Kearns,Leslie G. Valiant +1 more
TL;DR: It is proved that a polynomial-time learning algorithm for Boolean formulae, deterministic finite automata or constant-depth threshold circuits would have dramatic consequences for cryptography and number theory and is applied to obtain strong intractability results for approximating a generalization of graph coloring.
Computational limitations on learning from examples
Leonard Pitt,Leslie G. Valiant +1 more
TL;DR: It is shown for various classes of concept representations that these cannot be learned feasibly in a distribution-free sense unless R = NP, and relationships between learning of heuristics and finding approximate solutions to NP-hard optimization problems are given.
589
Crytographic limitations on learning Boolean formulae and finite automata
Michael Kearns,Leslie G. Valiant +1 more
- 01 Feb 1989
TL;DR: It is proved that for Boolean formulae, finite automata, and constant depth threshold circuits (simplified neural nets), this problem is computationally as difficult as the quadratic residue problem, inverting the RSA function and factoring Blum integers.
268
Improving the performance guarantee for approximate graph coloring
TL;DR: The best known polynomial-time algorithm for graphs on n vertices has a performance guarantee of O(n(log log n)2/(logn)2) as discussed by the authors.
•Journal Article
Improving the performance guarantee for approximate graph coloring
TL;DR: This paper presents an efficient algorithm with performance guarantee of O(n(loglog n)2/(logn)2) for graphs on n vertices.
131
References
•Book
Graph theory
Frank Harary
- 01 Jan 1969
TL;DR: This project focuses on Tutte’s work in cryptography, which enabled the British to read high-level German army messages and has been described as one of the greatest intellectual feats of the war.
18K
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
Planar 3-colorability is polynomial complete
TL;DR: The general problem of recognizing the set of pairs (G,k), where k is a positive integer and G is a graph which is k-colorable, is polynomial complete as defined by Karp [I].
155
•Journal Article
Graph Coloring Algorithms
Xiao Zhou,Takao Nishizeki +1 more
TL;DR: A survey of edge-coloring algorithms for graphs with fixed degeneracy, tree-width, genus, arboricity, unicyclic index or thickness can be found in this article.
33