Worst-case time bounds for coloring and satisfiability problems

Tomás Feder and Rajeev Motwani
J. Algorithms 45(2):192–201, Nov 2002

Cites:

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