Zoltan2
|
Graph coloring problems currently supported:
The algorithm currently implemented is a greedy linear-time algorithm. The default option is FirstFit color choice, but Random and LeastUsed are options to achieve better balance in the color sizes.
Currently serial; multithreaded coloring is planned for a future release.