> Graph Coloring Short Question>> Interference Information>> Variable | Interferes With> a | b,c,d,e> b | a,c,e> c | a,b,d> d | a,c> e | a,b>> Show with graph coloring how we can put them in three registers?>> Remove any node with less than K edges (K=3)>> 1. remove e> 2. remove d> 3. remove b> 4. remove a> 5. remove c>> How do we get from here to register allocation?>> I'm looking for the method not the answer, just a part of the method> I'm looking for - the bit where you go from reducing the graph to> allocating into registers.

They are one and the same.
Reducing the graph *is* allocating into registers.

As you reduce the graph, place the node you remove into a register. Mark
that register as used. No neighbors (ie if there is an edge between
them in the graph) can share the same register at the same time.
So if they aren't neighbors, they can be assigned the same
register.