Schiermeyer (3-Graph Coloring Graph Coloring)

Time Complexity

$O({1.415}^n)$

Space Complexity

$O(nm+n^{2})$ loose bound, possibly $O(n+m)$? words

((can be derived from steps of algorithm))

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1994

Reference

https://link.springer.com/chapter/10.1007/3-540-57899-4_51