Johnson (3-Graph Coloring Graph Coloring)

From Algorithm Wiki
Revision as of 12:14, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1.4422}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1988 == Reference == https://www.sciencedirect.com/science/article/abs/pii/0020019088900658")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O({1.4422}^n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1988

Reference

https://www.sciencedirect.com/science/article/abs/pii/0020019088900658

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