Byskov ( Chromatic Number)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O({80}^(n/{5})$) ~ $O({2.4023}^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/pii/S0167637704000409