Eppstein ( Chromatic Number)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(({4}/{3}+{3}^({4}/{3})$/{4})^n) ~ $O({2.4151}^n)$

Space Complexity

$O({2}^n)$ words

(https://arxiv.org/pdf/cs/0011009.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2003

Reference

https://arxiv.org/pdf/cs/0011009.pdf