Graph-coloring algorithm (greedy)


- Repeatedly remove a node with fewer than K neighbors and put it on astack, until the graph become empty;
- Repeatedly pop out a node from the stack and assign it with an availablecolor (which has not been used by its neighbors)


1. Live Range
2. Interval Graph
3. Graph Coloring










