Byskov, Theorem 20 ( 6 - Graph Coloring)
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