Brute force (4-Graph Coloring Graph Coloring)
Revision as of 11:32, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O((m+n)*{4}^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 ==")
Time Complexity
$O((m+n)*{4}^n)$
Space Complexity
$O(n)$ auxiliary words
((can be easily derived))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1852