Brélaz (DSatur) (3-Graph Coloring Graph Coloring)

From Algorithm Wiki
Revision as of 11:34, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Brélaz_(DSatur)_(3-Graph_Coloring_Graph_Coloring)&oldid=44493"