The Computational Complexity of Finding Subdesigns in Combinatorial Designs

Charles J. Colbourn, Marlenc J. Colbourn, Douglas R. Stineon

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


Algorithms for determining the existence of subdesigns in a combinatorial design are examined. When λ=1, the existence of a subdesign of order d in a design of order v can be determined in O(vlogd time. The order of the smallest subdesign can be computed in polynomial time. In addition, determining whether a design has a subdesign of maximal possible order (a “head”) requires polynomial time. When λ>1, the problems are apparently significantly more difficult: we show that deciding whether a block design has any non-trivial subdesign is NP-complete.

Original languageEnglish (US)
Pages (from-to)59-65
Number of pages7
JournalNorth-Holland Mathematics Studies
Issue numberC
StatePublished - Jan 1 1985
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)


Dive into the research topics of 'The Computational Complexity of Finding Subdesigns in Combinatorial Designs'. Together they form a unique fingerprint.

Cite this