Worst-case time bounds for coloring and satisfiability problems
Tomás Feder
and
Rajeev Motwani
J. Algorithms
45(2):192–201, Nov 2002
Cites:
3-coloring in time $O(1.3446^n)$: a no-MIS algorithm
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
