TY - JOUR
T1 - Concerning the complexity of deciding isomorphism of block designs
AU - Colbourn, Marlene J.
AU - Colbourn, Charles J.
N1 - Copyright:
Copyright 2018 Elsevier B.V., All rights reserved.
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 -