I am using the gcol python library to color the nodes of a graph with a minimum number of colors. Each node represents a task to execute. However, since there is limited processing capacity, better solutions exist if we can put a limit on the number of nodes selected per color. Gcol supports the equitable-k-coloring algorithm. This algorithm requires you to give a k upfront which defeats the purpose. The goal is minimize k. Does gcol support the default color-coloring algorithm with this additional constraint? Is there another (ideally python) library that does support this? Continue reading...
