Concerning the complexity of deciding isomorphism of block designs

DOI10.1016/0166-218X(81)90012-3zbMath0475.05075MaRDI QIDQ1159699

Charles J. Colbourn, Marlene J. Colbourn

Publication date: 1981

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

self-complementary graphsisomorphism testing

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Graph theory (05C99)

Related Items (6)

Computational complexity of reconstruction and isomorphism testing for designs and line graphs ⋮ Unnamed Item ⋮ Latin directed triple systems ⋮ The complexity of computing the automorphism group of automata and related problems ⋮ A parallelization of Miller's \(n^{\log n}\) isomorphism technique ⋮ Coined quantum walks lift the cospectrality of graphs and trees

Cites Work

• Problem 94
• A theorem on the maximum number of disjoint Steiner triple systems
• Balanced incomplete block designs and related designs
• On the maximum number of disjoint Steiner triple systems
• On the Complexity of Canonical Labeling of Strongly Regular Graphs
• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• Random Graph Isomorphism
• The graph isomorphism disease
• Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
• On the n^{log n} isomorphism technique (A Preliminary Report)
• Constructions of Disjoint Steiner Triple Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Concerning the complexity of deciding isomorphism of block designs