Brute-force search (3-Graph Coloring Graph Coloring)

From Algorithm Wiki

Revision as of 09:30, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brute-force_search_(3-Graph_Coloring_Graph_Coloring)&oldid=47292"