A fast backtrack algorithm for graph isomorphism (Q1106855): Difference between revisions

A backtrack algorithm is described to test two digraphs for isomorphism. Use is made of the degree sequence of vertices and a recursive procedure, using the distance matrices, to obtain the initial partitioning of vertices. The backtrack procedure maps vertices by composing rows and columns of the distance matrix. The algorithm is similar to that given by Schmidt and Druffel (1976) and is much faster than previously known algorithms.