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...
6 KB (758 words) - 15:30, 27 November 2023
graph colouring are the DSatur and recursive largest first (RLF) algorithms. Similarly to the greedy colouring algorithm, DSatur colours the vertices of...
67 KB (7,996 words) - 03:26, 15 August 2024
of its degeneracy orderings. Brélaz (1979) proposes a strategy, called DSatur, for vertex ordering in greedy coloring that interleaves the construction...
32 KB (3,887 words) - 07:10, 14 May 2024
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...
5 KB (831 words) - 16:50, 3 January 2023