3-coloring in time $O(1.3289^n)$

Richard Beigel and David Eppstein
J. Algorithms 54(2):168–204, Feb 2005
ACM Computing Research Repository, cs.DS/0006046
http://dx.doi.org/10.1016/j.jalgor.2004.06.008

Cited by:

• On the threshold
• The resolution complexity of random graph $k$-colorability
• The Resolution Complexity of Constraint Satisfaction
• Measure and conquer: a simple $O(n^{0.288n})$ independent set algorithm