Computing canonical images in permutation groups with Graph Backtracking

Abstract

We describe a new algorithm for finding a canonical image of an object under the action of a finite permutation group. This algorithm builds on previous work using Graph Backtracking, which extends Jeffrey Leon's Partition Backtrack framework. Our methods generalise both Nauty and Steve Linton's Minimal image algorithm.

arXiv commentThis is a revised version, as re-submitted