Computing canonical images in permutation groups with graph backtracking

DOI10.1016/J.JACA.2023.100010MaRDI QIDQ6671795zbMATH OpenFDO

Authors Christopher Jefferson, Rebecca Waldecker, Wilf A. Wilson

Publication date 27 January 2025

Published in Journal of Computational Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JACA.2023.100010

zbMATH Keywords

backtrack methodscanonical imagepermutation groupssearch algorithms

Mathematics Subject Classification ID

Permutation groups (20Bxx) Algorithms in computer science (68Wxx)

Recommendations

• Minimal and canonical images
• Permutation group algorithms based on directed graphs
• Finding the smallest image of a set
• scientific article; zbMATH DE number 1004935
• Permutation group algorithms based on partitions. I: Theory and algorithms

Cites work

• A unifying method for the design of algorithms canonizing combinatorial objects
• Engineering an efficient canonical labeling tool for large and sparse graphs
• Finding the smallest image of a set
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• scientific article; zbMATH DE number 1004935 (Why is no real title available?)
• Minimal and canonical images
• New refiners for permutation group search
• Perfect refiners for permutation group backtracking algorithms
• Permutation group algorithms based on directed graphs
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Practical graph isomorphism. II.
• The Magma algebra system. I: The user language
• The orbiter ecosystem for combinatorial data

Cited in

(1)

• Permutation group algorithms based on directed graphs

This page was built for publication: Computing canonical images in permutation groups with graph backtracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671795)