Lawler (3-Graph Coloring Graph Coloring)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(m*n*{3}^{(n/{3})}) ~ O(mn({1.445})^n)$

Space Complexity

$O(n)$ words

((can be easily derived; see section 6 of ref))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1976

Reference

https://www.sciencedirect.com/science/article/pii/002001907690065X?via%3Dihub