A general backtrack algorithm for the isomorphism problem of combinatorial objects (Q1087556)

A practical algorithm for the isomorphism problem that can be adapted to any class of combinatorial objects is presented. The parts of the algorithm that are dependent on the class of combinatorial objects and those that are independent of the class are identified and an interface between the two parts is developed to provide a general backtracking algorithm for the problem that incorporates the technique of branch-and- bound and uses the outhomorphisms of combinatorial objects to prune the search tree.