Class SmallestDegreeLastColoring

All Implemented Interfaces:
ColoringAlgorithm

public class SmallestDegreeLastColoring extends GreedyColoring

The smallest-last greedy algorithm computes the vertex ordering from the end to the beginning. At each step, the node of minimum degree in the current graph is selected and then it is removed from the graph. So, the first vertex to be selected is the one with the smallest degree in the graph, and it is stored at the end of the ordering. Suppose that the vertices V'={vi+1,..., vn} have been already selected, the next vertex to be chosen is vi in V-V' such that the degree of vi in the subgraph induced by the remaining vertices V-V' is minimal.

Author:
Cristian Frăsinaru
See Also:
  • Constructor Details

    • SmallestDegreeLastColoring

      public SmallestDegreeLastColoring(Graph graph)