3-coloring in time O(1.3289n)
BeigelRichard, EppsteinDavid · Journal of Algorithms · 2005
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...