Brélaz (DSatur) (3-Graph Coloring Graph Coloring)
Jump to navigation
Jump to search
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
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/10.1145/359094.359101