Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
Juraj Hromkovič
Springer-Verlag
,
2001
Cites:
3-coloring in time $O(1.3446^n)$: a no-MIS algorithm
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
