Alon and Kahale (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.24}^n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1997 == Reference == http://www.cs.tau.ac.il/~nogaa/PDFS/spectcolpr1.pdf")

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

Jump to navigation Jump to search

Time Complexity

$O({1.24}^n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1997

Reference

http://www.cs.tau.ac.il/~nogaa/PDFS/spectcolpr1.pdf

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