3-coloring in time $O(1.3446^n)$: a no-MIS algorithm

Richard Beigel and David Eppstein
Tech. report TR95-033, Electronic Colloq. on Computational Complexity, 1995
Proc. 36th Symp. Foundations of Computer Science, IEEE, Oct 1995, pp. 444–453
ftp://ftp.eccc.uni-trier.de/pub/eccc/reports/1995/TR95-033/index.html

Cited by:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!