Abstract: Graph-coloring is an NP-hard problem which has a myriad of applications. Register allocation, which is a crucial phase of a good optimizing compiler, relies on graph coloring. Hence, an ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback