Section 5.5 of the ColPack paper:
We have adapted the ordering techniques LF, ID, DLF and SL—the characterizations given in Section 5.1.1—to suit the various specialized coloring problems supported by ColPack. The adaptation involves extending the notion of degree, since the specialized algorithms involve visits to the distance-2 neighborhood of a vertex in a graph and/or the coloring is performed on a bipartite graph.
This means we need to adapt the notion of degree in a bipartite graph when we do LargestFirst ordering. This also gives me the way forward for #18
Section 5.5 of the ColPack paper:
This means we need to adapt the notion of degree in a bipartite graph when we do
LargestFirstordering. This also gives me the way forward for #18