The complexity of completing partial Latin squares

Charles J. Colbourn

doi:10.1016/0166-218X(84)90075-1

The complexity of completing partial Latin squares

Charles J. Colbourn

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

121 Scopus citations

Abstract

Completing partial Latin squares is shown to be NP-complete. Classical embedding techniques of Hall and Ryser underly a reduction from partitioning tripartite graphs into triangles. This in turn is shown to be NP-complete using a recent result of Holyer.

Original language	English (US)
Pages (from-to)	25-30
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	8
Issue number	1
DOIs	https://doi.org/10.1016/0166-218X(84)90075-1
State	Published - Apr 1984
Externally published	Yes

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/0166-218X(84)90075-1

Cite this

@article{5b863e6927924c05bb45944ab2b8355b,

title = "The complexity of completing partial Latin squares",

abstract = "Completing partial Latin squares is shown to be NP-complete. Classical embedding techniques of Hall and Ryser underly a reduction from partitioning tripartite graphs into triangles. This in turn is shown to be NP-complete using a recent result of Holyer.",

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

year = "1984",

month = apr,

doi = "10.1016/0166-218X(84)90075-1",

language = "English (US)",

volume = "8",

pages = "25--30",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The complexity of completing partial Latin squares

AU - Colbourn, Charles J.

PY - 1984/4

Y1 - 1984/4

N2 - Completing partial Latin squares is shown to be NP-complete. Classical embedding techniques of Hall and Ryser underly a reduction from partitioning tripartite graphs into triangles. This in turn is shown to be NP-complete using a recent result of Holyer.

AB - Completing partial Latin squares is shown to be NP-complete. Classical embedding techniques of Hall and Ryser underly a reduction from partitioning tripartite graphs into triangles. This in turn is shown to be NP-complete using a recent result of Holyer.

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

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

U2 - 10.1016/0166-218X(84)90075-1

DO - 10.1016/0166-218X(84)90075-1

M3 - Article

AN - SCOPUS:0037760934

SN - 0166-218X

VL - 8

SP - 25

EP - 30

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1

ER -

The complexity of completing partial Latin squares

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this