Class DSaturGreedyColoring

All Implemented Interfaces:
ColoringAlgorithm

public class DSaturGreedyColoring extends GreedyColoringBase

DSatur (Degree of Saturation) is an adaptive coloring algorithm in which the vertex ordering is not computed statically at the beginning. Once a new vertex has been colored, the algorithm determines which of the remaining uncolored vertices has the highest number of distinct colors in its neighborhood and colors this vertex next. This number is called the degree of saturation of a given vertex. DSatur produces exact results for bipartite, cycle, and wheel graphs. The complexity is O((n+m)lg n).

Author:
Cristian Frăsinaru