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 [9], which extends Jeffrey Leon's Partition Backtrack framework [14,15]. Our methods generalise both Nauty [17] and Steve Linton's Minimal image algorithm [16].