DSatur
id:
dsatur-284-4920606
title:
DSatur
text:
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 a graph one after another, adding a previously unused colour when needed. Once a new vertex has been coloured, the algorithm determines which of the remaining uncoloured vertices has the highest number of colours in its neighbourhood and colours this vertex next. Brélaz defines this number as the degree of saturation of a given vertex. The contra
brand slug:
wiki
category slug:
encyclopedia
description:
Graph colouring algorithm by Daniel Brélaz
original url:
https://en.wikipedia.org/wiki/DSatur
date created:
date modified:
2023-11-27T15:30:46Z
main entity:
{"identifier":"Q65117050","url":"https://www.wikidata.org/entity/Q65117050"}
image:
fields total:
13
integrity:
14