Brute-force search (3-Graph Coloring Graph Coloring)
Jump to navigation
Jump to search
Time Complexity
$O((m+n)*{3}^n)$
Space Complexity
$O(n)$ auxiliary words
((can be easily derived))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1852
Reference
-