Brélaz (DSatur) (3-Graph Coloring Graph Coloring): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(V + E)$ words (Derived using adjacency lists) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1979 == Reference == https://dl.acm.org/doi/10.1145/359094.359101") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O( | $O(n^{2})$ | ||
== Space Complexity == | == Space Complexity == | ||
$O( | $O(m+n)$ words | ||
(Derived using adjacency lists) | (Derived using adjacency lists) | ||
Latest revision as of 10:19, 28 April 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O(m+n)$ words
(Derived using adjacency lists)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1979