The complexity of combinatorial isomorphism problems

Marlene J. Colbourn, Charles J. Colbourn

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

Deciding isomorphism of balanced incomplete block designs is polynomial time equivalent to deciding graph isomorphism or isomorphism complete. Deciding isomorphism of (r, λ)-systems, exact set packings, pairwise balanced designs, and partially balanced incomplete block designs are all isomorphism complete problems. Isomorphism of exact set packings is isomorphism complete, isomorphism of pairwise balanced incomplete block designs (PBIBD's) is isomorphism complete, isomorphism of pairwise balanced designs (PBD's) is isomorphism complete, and balanced incomplete block designs (BIBD) isomorphism is isomorphism complete.

Original languageEnglish (US)
Pages (from-to)113-116
Number of pages4
JournalAnnals of Discrete Mathematics
Volume8
Issue numberC
DOIs
StatePublished - Jan 1 1980
Externally publishedYes

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'The complexity of combinatorial isomorphism problems'. Together they form a unique fingerprint.

  • Cite this