Johnson (3-Graph Coloring Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O({1.4422}^n)$
Space Complexity
()
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Year
1988
Reference
https://www.sciencedirect.com/science/article/abs/pii/0020019088900658