3-Coloring in Time O(1.3289^n)

  title={3-Coloring in Time O(1.3289^n)},
  author={R. Beigel and D. Eppstein},
  • R. Beigel, D. Eppstein
  • Published 2005
  • Computer Science, Mathematics
  • ArXiv
  • We consider worst case time bounds for several NP-complete problems, based on a constraint satisfaction (CSP) formulation of these problems: (a, b)-CSP instances consist of a set of variables, each with up to a possible values, and constraints disallowing certain b-tuples of variable values; a problem is solved by assigning values to all variables satisfying all constraints, or by showing that no such assignment exist. 3-SAT is equivalent to (2, 3)-CSP while 3-coloring and various related… CONTINUE READING
    Set Partitioning via Inclusion-Exclusion
    • 326
    • PDF
    Measure and conquer: a simple O(20.288n) independent set algorithm
    • 141
    • PDF
    Vertex Colouring and Forbidden Subgraphs – A Survey
    • 122
    • PDF
    Solving Connected Dominating Set Faster than 2n
    • 70
    • PDF
    Exact Algorithms for Treewidth and Minimum Fill-In
    • 79
    • PDF
    Algorithms for Counting 2-SAT Solutions and Colorings with Applications
    • 63
    • PDF
    Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
    • 56


    Publications referenced by this paper.
    A Computing Procedure for Quantification Theory
    • 2,820
    • PDF
    Algorithms for Constraint-Satisfaction Problems: A Survey
    • 1,089
    • PDF
    A probabilistic algorithm for k-SAT and constraint satisfaction problems
    • 312
    • Highly Influential
    • PDF
    Solving satisfiability in less than 2n steps
    • 281
    Algorithms for Maximum Independent Sets
    • 362
    • PDF
    A Note on the Complexity of the Chromatic Number Problem
    • 206
    Graph Coloring Problems
    • 1,097
    • PDF
    A Spectral Technique for Coloring Random 3-Colorable Graphs
    • 161
    On Generating All Maximal Independent Sets
    • 791
    On cliques in graphs
    • 750
    • PDF