Karger, Blum ( Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O(poly(V))$
Space Complexity
()
Description
Approximate?
Approximate
Approximation Factor: $\tilde{O}(n^{3/14})$
Randomized?
No, deterministic
Model of Computation
Year
1997
Reference
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4204