CiteSeerX — 3-Coloring in time O(1.3446^n): a no-MIS algorithm

3-Coloring in time O(1.3446^n): a no-MIS algorithm (1995) [9 citations — 0 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@MISC{Beigel953-coloringin,
    author = {Richard Beigel and David Eppstein},
    title = {3-Coloring in time O(1.3446^n): a no-MIS algorithm},
    year = {1995}
}

Bookmarks

OpenURL

Abstract:

We consider worst case time bounds for NPcomplete problems including 3-coloring, 3-edgecoloring, and 3-list-coloring. Our algorithms are based on a common generalization of these problems, called symbol-system satisfiability or, briefly, SSS [2]. 3-SAT is equivalent to (2,3)-SSS while the other problems above are special cases of (3,2)-SSS; there is also a natural duality transformation from (a; b)-SSS to (b; a)-SSS. We give a fast algorithm for (3,2)-SSS and use it to improve the time bounds for solving the other problems listed above. 1 Introduction There are many known NP-complete problems including such important graph theoretic problems as coloring and independent sets. Unless P=NP, we know that no polynomial time algorithm for these problems can exist, but that does not obviate the need to solve them as efficiently as possible, indeed the fact that these problems are hard makes efficient algorithms for them especially important. We are interested in this paper in worst case an...

Citations

202	B.: Graph Coloring Problems – Jensen, Toft
106	On generating all maximal independent sets – Johnson, Yannakakis, et al. - 1988
69	Algorithms for maximum independent sets – Robson - 1986
54	On cliques in graphs – Moon, Moser - 1965
52	Solving satisfiability in less than 2 n steps – Monien, Speckenmeyer - 1985
52	Finding a maximum independent set – Tarjan, Trojanowski - 1977
37	A note on the complexity of the chromatic number problem – Lawler - 1976
27	Solving 3-satisfiability in less than 1.579 n steps – Schiermeyer - 1992
21	An O(2 0.304n ) algorithm for solving maximum independent set problem – Jian - 1986
20	The Language of Machines: An introduction to Computability and Formal Languages – FLOYD, BEIGEL - 1994
16	Obere Komplexitatsschranken fur TAUT-Entscheidungen – Luckhardt - 1984
11	A systematical approach to 3-SAT-decision, yielding 3-SAT-decision in less than 1:5045 n steps – Kullmann - 1996
10	A simple algorithm for finding a maximum clique and its worst-case time complexity, Systems Comput – Shindo, Tomita - 1990
6	Two systems for proving tautologies, based on the split method – Dantsin - 1983
6	Deciding 3-Colourability in less than O(1:415 n ) Steps – Schiermeyer - 1994
4	Various upper bounds on the complexity of algorithms for deciding propositional tautologies. Manuscript available from kullmann@mi.informatik. uni-frankfurt.de – Kullmann, Luckhardt - 1994