|
|
|
|
|
|
by Const-me
1794 days ago
|
|
|
Graph coloring can mean vertex coloring, edge coloring, or total coloring. These are 3 different problems. Regardless on the answer, I think this gonna be way too slow for your use case. Especially if you want the global optimum. Wikipedia says the current state-of-the-art is randomized algorithms, I don’t think these algorithms are looking for global optima. I don’t recommend solving that, I think you’ll waste your time. How’s that related to the keyboard anyway? |
|
|