Permutation group algorithms based on directed graphs

DOI10.1016/j.jalgebra.2021.06.015OpenAlexW3176739601MaRDI QIDQ2042953

Wilf A. Wilson, Markus Pfeiffer, Christopher Jefferson, Rebecca Waldecker

Publication date: 22 July 2021

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

Full work available at URL: https://arxiv.org/abs/2106.13132

zbMATH Keywords

permutation groupsgraphsdigraphsbacktrack searchsearch algorithmscomputational group theory

Mathematics Subject Classification ID

Permutation groups (20Bxx)

Related Items (6)

Towards Efficient Normalizers of Primitive Groups ⋮ Perfect refiners for permutation group backtracking algorithms ⋮ Moduli of polarised Enriques surfaces — Computational aspects ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Permutation group algorithms based on directed graphs ⋮ GraphBacktracking

Uses Software

• GAP
• nauty
• Traces
• bliss
• Digraphs
• TransGrp
• PrimGrp
• BacktrackKit

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permutation group algorithms based on partitions. I: Theory and algorithms
• New refiners for permutation group search
• Permutation group algorithms based on directed graphs
• Practical graph isomorphism. II.
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs

This page was built for publication: Permutation group algorithms based on directed graphs