2

I'd like to know whether recent graph coloring algorithms that one can find nicely listed here have found it's place in real world applications or are they just simply pushing boundaries in this particular field of combinatoral optimization?

I already know that graph coloring naturally arises during register allocation as part of compiler optimization as well as in bandwidth allocation and scheduling problems. I also know that coloring techniques deployed in these areas are somewhat different than those provided in link. Algorithms one can find under link are mostly based on meta-heuristics and hybridizations and I believe are not helpful in register allocation, for certain.

Marko Bukal
  • 141
  • 4

0 Answers0