Byskov (4-Graph Coloring Graph Coloring)
Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({1.7504}^n)$ == Space Complexity == $O(n^{2})$? words (can be derived from algo 89 plus the paper's algo for finding MIS's?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://www.sciencedirect.com/science/article/abs/pii/S0167637704000409?via%3Dihub")
Time Complexity
$O({1.7504}^n)$
Space Complexity
$O(n^{2})$? words
(can be derived from algo 89 plus the paper's algo for finding MIS's?)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2004
Reference
https://www.sciencedirect.com/science/article/abs/pii/S0167637704000409?via%3Dihub