A parallelization of Miller's \(n^{\log n}\) isomorphism technique

DOI10.1016/0020-0190(92)90243-OzbMath0769.05085OpenAlexW2048558076MaRDI QIDQ1198063

Luc Teirlinck, Charles J. Colbourn, Douglas R. Stinson

Publication date: 16 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(92)90243-o

zbMATH Keywords

complexityparallel algorithmssequential algorithmisomorphismSteiner triple systems

Mathematics Subject Classification ID

Loops, quasigroups (20N05) Graph algorithms (graph-theoretic aspects) (05C85) Triple systems (05B07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distributed algorithms (68W15)

Related Items (1)

Steiner triple systems of order 19 with nontrivial automorphism group

Cites Work

• Sorting in \(c \log n\) parallel steps
• Concerning the complexity of deciding isomorphism of block designs
• Embedding Partial Steiner Triple Systems
• Implementation of simultaneous memory address access in models that forbid it
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallelization of Miller's \(n^{\log n}\) isomorphism technique