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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have