Byskov, Theorem 20 ( 6 - Graph Coloring): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:5411:54, 15 February 2023‎ Admin talk contribs‎ 402 bytes +402‎ Created page with "== Time Complexity == $O({2.2680}^n)$ == Space Complexity == $O({2}^n)$ words (https://www.sciencedirect.com/science/article/pii/S0167637704000409) == 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Byskov,_Theorem_20_(_6_-_Graph_Coloring)"