DSatur is a graph colouring algorithm put forward by Daniel Brélaz in 1979. Similarly to the greedy colouring algorithm, DSatur colours the vertices of...

graph colouring are the DSatur and recursive largest first (RLF) algorithms. Similarly to the greedy colouring algorithm, DSatur colours the vertices of...

of its degeneracy orderings. Brélaz (1979) proposes a strategy, called DSatur, for vertex ordering in greedy coloring that interleaves the construction...

and the O ( ( n + m ) lg ⁡ n ) {\displaystyle {\mathcal {O}}((n+m)\lg n)} DSatur algorithm on random graphs. However, runtimes with RLF were also seen to...