Karger, Blum ( Graph Coloring)

From Algorithm Wiki
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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Karger,_Blum_(_Graph_Coloring)&oldid=44492"