Beigel & Eppstein (3-Graph Coloring Graph Coloring): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O({1.3446}^n)$ == Space Complexity == $O(n^{2})$? words (can be derived from steps of algorithm? you add at most O(n^2) constraints, other info shouldn't take more than O(n^2) space, and you can reuse space during recursive steps) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://ieeexplore.ieee.org/stamp/stamp.jsp?arnum...") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O({1. | $O({1.3289}^n)$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 7: | Line 7: | ||
$O(n^{2})$? words | $O(n^{2})$? words | ||
(can be derived from steps of algorithm? | (can be derived from steps of algorithm? similar to above) | ||
== Description == | == Description == | ||
| Line 27: | Line 27: | ||
== Year == | == Year == | ||
2000 | |||
== Reference == | == Reference == | ||
https:// | https://www.sciencedirect.com/science/article/pii/S0196677404001117?via%3Dihub | ||
Revision as of 11:36, 15 February 2023
Time Complexity
$O({1.3289}^n)$
Space Complexity
$O(n^{2})$? words
(can be derived from steps of algorithm? similar to above)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2000
Reference
https://www.sciencedirect.com/science/article/pii/S0196677404001117?via%3Dihub