nishe: a canonical labeling package: Efficient isomorphism of Miyazaki graphs. .. We present a modification to the canonical-labeling algorithm used by nauty. We employ discovered automorphisms to ensure that a canonical labeling is determined in polynomial time for colored Miyazaki graphs. These automorphisms can be used to make better choices during the course of execution; so we use a guide tree to change the search depending on partial knowledge of the full automorphism group. The proposed modifications are not specific to Miyazaki graphs. Any graph with a nontrivial automorphism group can benefit from our approach.
References in zbMATH (referenced in 1 article )
Showing result 1 of 1.