Lawler (3-Graph Coloring Graph Coloring): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(m*n*{3}^{(n/{3})}) ~ O(mn({1.445})^n)$ == Space Complexity == $O(n+m)$ words ((can be easily derived; see section 6 of ref)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://www.sciencedirect.com/science/article/pii/002001907690065X?via%3Dihub") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O(n | $O(n)$ words | ||
((can be easily derived; see section 6 of ref)) | ((can be easily derived; see section 6 of ref)) | ||
Latest revision as of 10:20, 28 April 2023
Time Complexity
$O(m*n*{3}^{(n/{3})}) ~ O(mn({1.445})^n)$
Space Complexity
$O(n)$ words
((can be easily derived; see section 6 of ref))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1976
Reference
https://www.sciencedirect.com/science/article/pii/002001907690065X?via%3Dihub