Assertion: register | /r/CapableOf | represent node
Facets:
Source sentences:
text: They reduce the register allocation problem to the problem of graph coloring by showing that for an arbitrary graph, a program can be constructed such that the register allocation for the program (with registers representing nodes and machine registers representing available colors) would be a coloring for the original graph.