3-Coloring in Time O(1.3289^n)

@article{Beigel20053ColoringIT,
title={3-Coloring in Time O(1.3289^n)},
author={Richard Beigel and David Eppstein},
journal={J. Algorithms},
year={2005},
volume={54},
pages={168-204}
}
• Published 30 June 2000
• Computer Science, Mathematics
• J. Algorithms
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…
141 Citations
Dominating set based exact algorithms for 3-coloring
• Mathematics, Computer Science
Inf. Process. Lett.
• 2011
It is shown that the 3-colorability problem can be solved in O(1.296^n) time on any n-vertex graph with minimum degree at least 15 and that a 3-coloring can be obtained in 2^o^(^n^) time for graphs having minimumdegree at least @w(n) where @w (n) is any function which goes to ~.
Improved Exponential Algorithms for SAT and ClSP
Satisfiability of Boolean formulas (SAT) is one of the most prominent NP-complete problems. We consider k-SAT, the decision problem that asks whether formulas in conjunctive normal form (CNF) with
Algorithms and Hardness Results for Some Valued CSPs
In the Constraint Satisfaction Problem (CSP) one is supposed to find an assignment to a set of variables so that a set of given constraints are satisfied. Many problems, both practical and
Almost Exact Graph 3-Coloring in O(1.277^n) Time
• Computer Science
CTW
• 2012
A new algorithm for almost exact graph 3-coloring based on maximal independent set enumeration is described, and the apparent infrequency with which it fails to produce a minimum coloring is discussed.
Algorithms and Almost Tight Results for 3-Colorability of Small Diameter Graphs
• Computer Science, Mathematics
SOFSEM
• 2013
It is proved that for every varepsilon, 3-coloring is NP-complete on triangle-free graphs of diameter 3 and radius 2 with n vertices and minimum degree δ = Θ(n e ).
Improved Bounds for Exact Counting of Satisfiability Solutions ∗
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with n
Exploiting structure to cope with NP-hard graph problems : polynomial and exponential time exact algorithms
This thesis presents several polynomial time algorithms for solving restrictions of these problems to specific graph classes, in particular graphs without long induced paths, chordal graphs and clawfree graphs.
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
• Mathematics, Computer Science
CPM
• 2009
Several positive (fixed-parameter) tractability results are presented and a large spectrum of combinatorial research challenges for Interval Constrained Coloring is identified, based on a thorough analysis of the known NP-hardness proof.
Linear-programming design and analysis of fast algorithms for Max 2-Sat and Max 2-CSP
• Mathematics
• 2006
The class \$(r,2)\$-CSP, or simply Max 2-CSP, consists of constraint satisfaction problems with at most two \$r\$-valued variables per clause. For instances with \$n\$ variables and \$m\$ binary clauses, we
On the Partition of 3-Colorable Graphs
• Computer Science, Mathematics
COCOA
• 2011
This paper develops the first parameter algorithm of complexity O*(1.713k), taking the size of the bipartite subgraph as the parameter k, and uses measures other than the given parameter k to achieve better analysis on running time.