Brute force (4-Graph Coloring Graph Coloring)

From Algorithm Wiki
Jump to navigation Jump to search

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