[Ar-Curunir]

This algorithm in its current state really doesn't; GI for most natural instances was already being solved quickly via some heuristics.

This algorithm proves a quasipolynomial upper bound on the complexity of GI.