The complixity of McKay's canonical labeling algorithm


We study the time complexity of McKay’s algorithm to compute canonical forms and automorphism groups of graphs. The algorithm is based on a type of backtrack search, and it performs pruning by discovered automorphisms and by hashing partial information of vertex labelings. In practice, the algorithm is implemented in the nauty package. We obtain colorings… (More)

5 Figures and Tables