Byskov, Theorem 20 ( 6 - Graph Coloring)

From Algorithm Wiki
Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2.2680}^n)$ == Space Complexity == $O({2}^n)$ words (https://www.sciencedirect.com/science/article/pii/S0167637704000409) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0167637704000409?via%3Dihub")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({2.2680}^n)$

Space Complexity

$O({2}^n)$ words

(https://www.sciencedirect.com/science/article/pii/S0167637704000409)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2004

Reference

https://www.sciencedirect.com/science/article/abs/pii/S0167637704000409?via%3Dihub

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Byskov,_Theorem_20_(_6_-_Graph_Coloring)&oldid=45038"