Permutation Group Algorithms

By Á. Seress. 2003

408 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/20bc26029fa04674e8e1f53476c011bb546af921

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Adolfo Piperno
2. Tommi A. Junttila
3. Brendan D. McKay
4. Petteri Kaski

In Computational Theory and Mathematics

1. Adolfo Piperno
2. Tommi A. Junttila
3. Brendan D. McKay
4. Petteri Kaski
5. Nicholas A. Cook
6. Charles Bordenave
7. Muhan Zhang
8. Yixin Chen

In Electrical and Electronic Engineering

1. Adolfo Piperno
2. Tommi A. Junttila
3. Brendan D. McKay
4. Petteri Kaski
5. Ferenc SzollHosi

Citations in the corpus

• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs (2007, background): “(Computationally more expensive strategies for eliminating redundancy appear in [25, 26]; see also [37].”
• Practical graph isomorphism, II (2013, methodology): “This stabiliser could be computed with a deterministic algorithm as proposed by Kocay (1996) and Butler and Lam (1985), but we have found the random Schreier method (Seress, 2003) to be more efficient and it doesn’t matter if occasionally (due to its probabilistic nature) it computes smaller orbits.”