Hirsch (3-Graph Coloring Graph Coloring)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O({1.239}^n)$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

1998

Reference

https://dl.acm.org/doi/10.5555/314613.314838

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