Concerning the complexity of deciding isomorphism of block designs

Marlene J. Colbourn, Charles Colbourn

Research output: Contribution to journal › Article

11 Citations (Scopus)

Abstract

A construction is described to encode an arbitrary graph uniquely as a block design. This demonstrates that describing whether two block designs (without repeated blocks) are isomorphic is polynomial time equivalent to solving graph isomorphism. This result supplies evidence for the claim that isomorphism testing for block designs is a hard subcase of graph isomorphism.

Original languageEnglish (US)
Pages (from-to)155-162
Number of pages8
JournalDiscrete Applied Mathematics
Volume3
Issue number3
DOIs
StatePublished - 1981
Externally publishedYes

Fingerprint

Block Design
Graph Isomorphism
Isomorphism
Polynomial time
Isomorphic
Polynomials
Testing
Arbitrary
Graph in graph theory
Demonstrate

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Concerning the complexity of deciding isomorphism of block designs. / Colbourn, Marlene J.; Colbourn, Charles.

In: Discrete Applied Mathematics, Vol. 3, No. 3, 1981, p. 155-162.

Research output: Contribution to journal › Article

Colbourn, MJ & Colbourn, C 1981, 'Concerning the complexity of deciding isomorphism of block designs', Discrete Applied Mathematics, vol. 3, no. 3, pp. 155-162. https://doi.org/10.1016/0166-218X(81)90012-3
Colbourn MJ, Colbourn C. Concerning the complexity of deciding isomorphism of block designs. Discrete Applied Mathematics. 1981;3(3):155-162. https://doi.org/10.1016/0166-218X(81)90012-3
Colbourn, Marlene J. ; Colbourn, Charles. / Concerning the complexity of deciding isomorphism of block designs. In: Discrete Applied Mathematics. 1981 ; Vol. 3, No. 3. pp. 155-162.
@article{dbe31b160e1e4873b4825a5f35ec41ea,
title = "Concerning the complexity of deciding isomorphism of block designs",
abstract = "A construction is described to encode an arbitrary graph uniquely as a block design. This demonstrates that describing whether two block designs (without repeated blocks) are isomorphic is polynomial time equivalent to solving graph isomorphism. This result supplies evidence for the claim that isomorphism testing for block designs is a hard subcase of graph isomorphism.",
author = "Colbourn, {Marlene J.} and Charles Colbourn",
year = "1981",
doi = "10.1016/0166-218X(81)90012-3",
language = "English (US)",
volume = "3",
pages = "155--162",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Concerning the complexity of deciding isomorphism of block designs

AU - Colbourn, Marlene J.

AU - Colbourn, Charles

PY - 1981

Y1 - 1981

N2 - A construction is described to encode an arbitrary graph uniquely as a block design. This demonstrates that describing whether two block designs (without repeated blocks) are isomorphic is polynomial time equivalent to solving graph isomorphism. This result supplies evidence for the claim that isomorphism testing for block designs is a hard subcase of graph isomorphism.

AB - A construction is described to encode an arbitrary graph uniquely as a block design. This demonstrates that describing whether two block designs (without repeated blocks) are isomorphic is polynomial time equivalent to solving graph isomorphism. This result supplies evidence for the claim that isomorphism testing for block designs is a hard subcase of graph isomorphism.

UR - http://www.scopus.com/inward/record.url?scp=0019587047&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0019587047&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(81)90012-3

DO - 10.1016/0166-218X(81)90012-3

M3 - Article

VL - 3

SP - 155

EP - 162

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -

Access to Document