The computational complexity of decomposing block designs

Charles J. Colbourn; Marlene J. Colbourn

doi:10.1016/S0304-0208(08)73027-5

The computational complexity of decomposing block designs

Charles J. Colbourn, Marlene J. Colbourn

Research output: Contribution to journal › Article

Abstract

Deciding whether a (balanced incomplete) block design with λ = 3 can be decomposed, or partitioned, into block designs with smaller λ is shown to be NP-complete. The transformation employs known NP-completeness results on edge-partitioning graphs into triangles. The reduction also furnishes a construction of indecomposable triple systems with arbitrary odd λ, settling a question of Kramer.

Original language	English (US)
Pages (from-to)	345-350
Number of pages	6
Journal	North-Holland Mathematics Studies
Volume	115
Issue number	C
DOIs	https://doi.org/10.1016/S0304-0208(08)73027-5
State	Published - Jan 1 1985
Externally published	Yes

Fingerprint

ASJC Scopus subject areas

Mathematics(all)

Cite this

Colbourn, C. J., & Colbourn, M. J. (1985). The computational complexity of decomposing block designs. North-Holland Mathematics Studies, 115(C), 345-350. https://doi.org/10.1016/S0304-0208(08)73027-5

@article{c20aa9ce199246adaba2d777f2e2e807,

title = "The computational complexity of decomposing block designs",

abstract = "Deciding whether a (balanced incomplete) block design with λ = 3 can be decomposed, or partitioned, into block designs with smaller λ is shown to be NP-complete. The transformation employs known NP-completeness results on edge-partitioning graphs into triangles. The reduction also furnishes a construction of indecomposable triple systems with arbitrary odd λ, settling a question of Kramer.",

author = "Colbourn, {Charles J.} and Colbourn, {Marlene J.}",

year = "1985",

month = jan

day = "1",

doi = "10.1016/S0304-0208(08)73027-5",

language = "English (US)",

volume = "115",

pages = "345--350",

journal = "North-Holland Mathematics Studies",

issn = "0304-0208",

publisher = "Elsevier",

number = "C",

}

TY - JOUR

T1 - The computational complexity of decomposing block designs

AU - Colbourn, Charles J.

AU - Colbourn, Marlene J.

PY - 1985/1/1

Y1 - 1985/1/1

N2 - Deciding whether a (balanced incomplete) block design with λ = 3 can be decomposed, or partitioned, into block designs with smaller λ is shown to be NP-complete. The transformation employs known NP-completeness results on edge-partitioning graphs into triangles. The reduction also furnishes a construction of indecomposable triple systems with arbitrary odd λ, settling a question of Kramer.

AB - Deciding whether a (balanced incomplete) block design with λ = 3 can be decomposed, or partitioned, into block designs with smaller λ is shown to be NP-complete. The transformation employs known NP-completeness results on edge-partitioning graphs into triangles. The reduction also furnishes a construction of indecomposable triple systems with arbitrary odd λ, settling a question of Kramer.

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

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

U2 - 10.1016/S0304-0208(08)73027-5

DO - 10.1016/S0304-0208(08)73027-5

M3 - Article

AN - SCOPUS:77956915144

VL - 115

SP - 345

EP - 350

JO - North-Holland Mathematics Studies

JF - North-Holland Mathematics Studies

SN - 0304-0208

IS - C

ER -

Access to Document

10.1016/S0304-0208(08)73027-5