At first glance it looks like this is very useful, but it only gives a speedup for very sparse graphs with an average degree of less than 3, unless your graph is very big, as in trillions of vertices.
MarkusQ•6mo ago
Degree less than 6? If m < 3n that means there are three times as many edges as nodes, and each edge connect to two vertices.
random3•6mo ago