Small maximal independent sets and faster exact graph coloring

David Eppstein
J. Graph Algorithms & Applications 7(2):131–140, 2003
Proc. 7th Worksh. Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science 2125, Frank K. H. A. Dehne, Jörg-Rudiger Sack, and Roberto Tamassia, ed., Springer-Verlag, Aug 2001, pp. 462–470
ACM Computing Research Repository, cs.DS/0011009
Mathematical Reviews 2003j:05117

Cited by:

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