Graph-coloring algorithm (greedy)

  • Repeatedly remove a node with fewer than K neighbors and put it on a stack, until the graph become empty;
  • Repeatedly pop out a node from the stack and assign it with an available color (which has not been used by its neighbors)
 
 
  1. Live Range
  1. Interval Graph
  1. Graph Coloring
 
 
 
 
 
 
 
 

Recommendations