Concerning the complexity of deciding isomorphism of block designs

Marlene J. Colbourn; Charles J. Colbourn

doi:10.1016/0166-218X(81)90012-3

Concerning the complexity of deciding isomorphism of block designs

Marlene J. Colbourn, Charles J. Colbourn

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

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 language	English (US)
Pages (from-to)	155-162
Number of pages	8
Journal	Discrete Applied Mathematics
Volume	3
Issue number	3
DOIs	https://doi.org/10.1016/0166-218X(81)90012-3
State	Published - Jul 1981
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

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

Cite this

@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 Colbourn, {Charles J.}",

year = "1981",

month = jul,

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 J.

PY - 1981/7

Y1 - 1981/7

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

AN - SCOPUS:0019587047

VL - 3

SP - 155

EP - 162

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -

Concerning the complexity of deciding isomorphism of block designs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this