Karger, Blum ( Graph Coloring)
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (Created page with "== 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")
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