Beigel & Eppstein (3-Graph Coloring Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O({1.3289}^n)$
Space Complexity
$O(n^{2})$? words
(can be derived from steps of algorithm? similar to above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2000
Reference
https://www.sciencedirect.com/science/article/pii/S0196677404001117?via%3Dihub