The complexity of completing partial Latin squares
- 30 April 1984
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 8 (1), 25-30
- https://doi.org/10.1016/0166-218x(84)90075-1
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Embedding partial steiner triple systems is NP-completeJournal of Combinatorial Theory, Series A, 1983
- The NP-Completeness of Some Edge-Partition ProblemsSIAM Journal on Computing, 1981
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973
- Systems of Distinct Representations and Linear ProgrammingThe American Mathematical Monthly, 1956
- A combinatorial theorem with an application to latin rectanglesProceedings of the American Mathematical Society, 1951
- Distinct representatives of subsetsBulletin of the American Mathematical Society, 1948
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935