Concerning the complexity of deciding isomorphism of block designs
From MaRDI portal
(Redirected from Publication:1159699)
Cites work
- scientific article; zbMATH DE number 3663155 (Why is no real title available?)
- scientific article; zbMATH DE number 3664988 (Why is no real title available?)
- scientific article; zbMATH DE number 3667973 (Why is no real title available?)
- scientific article; zbMATH DE number 3604941 (Why is no real title available?)
- scientific article; zbMATH DE number 3623616 (Why is no real title available?)
- scientific article; zbMATH DE number 3628390 (Why is no real title available?)
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
- A theorem on the maximum number of disjoint Steiner triple systems
- Balanced incomplete block designs and related designs
- Constructions of Disjoint Steiner Triple Systems
- Graph theory
- Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
- On the Complexity of Canonical Labeling of Strongly Regular Graphs
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the maximum number of disjoint Steiner triple systems
- Problem 94
- Random Graph Isomorphism
- The graph isomorphism disease
Cited in
(6)- The complexity of computing the automorphism group of automata and related problems
- Coined quantum walks lift the cospectrality of graphs and trees
- Computational complexity of reconstruction and isomorphism testing for designs and line graphs
- On the complexity of identifying strongly regular graphs
- A parallelization of Miller's \(n^{\log n}\) isomorphism technique
- Latin directed triple systems
This page was built for publication: Concerning the complexity of deciding isomorphism of block designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1159699)
