• Suppose on simplify that all nodes have significant degree (degree <= K) • Pick and mark a node for spilling – Decision is to represent it in memory during execution • Optimistically assume spilled node can be allocated with neighbours – Stack it, then continue with the simplify