This is an NP-complete problem, so you need to know that no optimal solution can be found in a reasonable time for large problems. Apparently, the interference

This is an NP-complete problem, so you need to know that no optimal solution can be found in a reasonable time for large problems. Apparently, the interference graphs that arise from SSA code are a well-behaved sort of graph, colorable in polynomial time. http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/6532 http://digbib.ubka.uni-karlsruhe.de/volltexte/documents/6532