Lawler (4-Graph Coloring Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O((m + n)*{2}^n)$
Space Complexity
$O(n+m)$ 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