The complexity of completing partial Latin squares

Research output: Contribution to journalArticle

97 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)25-30
Number of pages6
JournalDiscrete Applied Mathematics
Volume8
Issue number1
DOIs
StatePublished - 1984
Externally publishedYes

Fingerprint

Magic square
NP-complete problem
Partial
Graph Partitioning
Triangle

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

The complexity of completing partial Latin squares. / Colbourn, Charles.

In: Discrete Applied Mathematics, Vol. 8, No. 1, 1984, p. 25-30.

Research output: Contribution to journalArticle

@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 = "Charles Colbourn",
year = "1984",
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

PY - 1984

Y1 - 1984

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

VL - 8

SP - 25

EP - 30

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1

ER -