Enumerating maximal independent sets with applications to graph colouring
Jesper Makholm Byskov
Operations Research Letters
32:547–556, 2004
Cites:
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
Small maximal independent sets and faster exact graph coloring
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
