Login / Signup

Revisiting Graph Coloring Register Allocation: A Study of the Chaitin-Briggs and Callahan-Koblenz Algorithms.

Keith D. CooperAnshuman DasguptaJason Eckhardt
Published in: LCPC (2005)
Keyphrases
  • graph coloring
  • learning algorithm
  • combinatorial problems
  • computational complexity
  • optimization problems
  • np complete problems
  • lower bound
  • search space
  • distributed breakout