EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Computing canonical images in permutation groups with Graph Backtracking

Christopher Jefferson, Rebecca Waldecker, Wilf A. Wilson

Journal of Computational Algebra · 2023

DOI: 10.1016/j.jaca.2023.100010 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computational Algebra, 2023. Verfasst von Christopher Jefferson und 2 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Volkswagen Foundation, DFG, Royal Society.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Volkswagen Foundation
  • DFG
  • Royal Society

Zitieren

APA

Jefferson, C., Waldecker, R., & Wilson, W. A. (2023). Computing canonical images in permutation groups with Graph Backtracking. Journal of Computational Algebra. https://doi.org/10.1016/j.jaca.2023.100010

Vancouver

Jefferson C, Waldecker R, Wilson WA. Computing canonical images in permutation groups with Graph Backtracking. Journal of Computational Algebra. 2023. doi:10.1016/j.jaca.2023.100010

BibTeX
@article{Jefferson2023,
  author = {Jefferson, Christopher and Waldecker, Rebecca and Wilson, Wilf A.},
  title = {Computing canonical images in permutation groups with Graph Backtracking},
  journal = {Journal of Computational Algebra},
  year = {2023},
  doi = {10.1016/j.jaca.2023.100010}
}
Kostenlos starten →