Abstract: Graph coloring is a well-known combinatorial optimization problem with broad applications in network security, scheduling, and register allocation. Being an NP-hard problem, exact solutions ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results