On the nlog n isomorphism technique (A Preliminary Report)

Authors:
Gary L. Miller
Affiliations:
-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 2
Cited 20

An Efficient Algorithm for Graph Isomorphism

Journal of the ACM (JACM)
A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices

Journal of the ACM (JACM)

Faster isomorphism testing of strongly regular graphs

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Hypergraph isomorphism and structural equivalence of Boolean functions

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On Recognizing Cayley Graphs

ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Testing isomorphism of cone graphs(Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Canonical labeling of graphs

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Linear time algorithms for Abelian group isomorphism and related problems

Journal of Computer and System Sciences
Permutation group approach to association schemes

European Journal of Combinatorics
Factoring Groups Efficiently

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Linear and Sublinear Time Algorithms for Basis of Abelian Groups

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Computational complexity of reconstruction and isomorphism testing for designs and line graphs

Journal of Combinatorial Theory Series A
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP

ACM Transactions on Computation Theory (TOCT)
Linear and sublinear time algorithms for the basis of abelian groups

Theoretical Computer Science
Code equivalence and group isomorphism

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The complexity of quasigroup isomorphism and the minimum generating set problem

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Arthur-Merlin games and the problem of isomorphism testing

CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Polynomial-time isomorphism test for groups with no abelian normal subgroups

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Quasipolynomial-time canonical form for steiner designs

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems

Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism

ACM Transactions on Computation Theory (TOCT)
On the automorphism groups of strongly regular graphs I

Proceedings of the 5th conference on Innovations in theoretical computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tarjan has given an algorithm for deciding isomorphism of two groups of order n (given as multiplication tables) which runs in O(n(log2n+O(1)) steps where n is the order of the groups. Tarjan uses the fact that a group of n is generated by log n elements. In this paper, we show that Tarjan's technique generalizes to isomorphism of quasigroups, latin squares, Steiner systems, and many graphs generated from these combinatorial objects.