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}
}
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… 
Dominating set based exact algorithms for 3-coloring
TLDR
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
TLDR
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
TLDR
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
TLDR
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
TLDR
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
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
TLDR
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.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 50 REFERENCES
3-coloring in time 0(1.3446/sup n/): a no-MIS algorithm
  • R. Beigel, D. Eppstein
  • Mathematics, Computer Science
    Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
TLDR
This work gives a fast algorithm for (3,2)-SSS and uses it to improve the time bounds for solving the other problems listed above.
Algorithms for k-colouring and finding maximal independent sets
TLDR
This extended abstract proves that the number of maximal independent sets of size at most k (k-MIS's) in a graph is at most d 1)dk-nd n-(d-1)k for any d > 4, and constructs algorithms for finding the chromatic number using exponential space, whereas the other algorithms use only polynomial space.
A Spectral Technique for Coloring Random 3-Colorable Graphs
TLDR
A polynomial-time algorithm that finds a proper 3-coloring of G3n,p,3 with high probability, whenever p $\geq$ c/n, where c is a sufficiently large absolute constant.
A Spectral Technique for Coloring Random 3-Colorable Graphs
18 until the number of vertices left is O(n=d), and color the remaining vertices in an arbitrary manner. 7. The existence of an approximation algorithm based on the spectral method for coloring
A Note on the Complexity of the Chromatic Number Problem
  • E. Lawler
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 1976
TLDR
It is shown, by very simple arguments, that the chromatic number of an arb?rary graph to within a given factor r < 2 has also been shown to “be Nkomplete” and there is very little prospect of fmding an efficient, i.e. polynomialbounded, algorithm for the general problem, although some special cases can be solved effkien?ly.
Finding maximum independent sets in sparse and general graphs
  • R. Beigel
  • Mathematics, Computer Science
    SODA '99
  • 1999
TLDR
The fastest MIS algorithms for sparse graphs and for graphs whose degree is bounded by 3 or by 4 are obtained, and the fastest MIS algorithm for bounded-degree graphs is obtained.
Small Maximal Independent Sets and Faster Exact Graph Coloring
  • D. Eppstein
  • Computer Science, Mathematics
    J. Graph Algorithms Appl.
  • 2003
TLDR
It is shown how to compute the exact chromatic number of a graph in time O(4/3 + 34/3/4)n, improving a previous O((1 + 31/3)n) ≅ 2.4422n algorithm of Lawler (1976).
A New Approach on Solving 3-Satisfiability
TLDR
An algorithm for solving the 3-satisfiability problem is described and it is shown that the algorithm on subquadrangles guarantees a solution in time less than O(1.476n), which improves the current well-known 3-Satisfiability algorithms.
Two new upper bounds for SAT
TLDR
A new transformation rule is presented and two algorithms using this rule have the bounds 2°.30897K and 2.‘0537L respectively.
Systematic generation of very hard cases for graph 3-colorability
  • Romulus Dan Vlasie
  • Computer Science
    Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence
  • 1995
We present a simple generation procedure which turns out to be an effective source of very hard cases for graph 3-colorability. The graphs distributed according to this generation procedure are much
...
1
2
3
4
5
...