The complexity of completing partial Latin squares

Recommendations

scientific article; zbMATH DE number 1556753
On the completability of incomplete Latin squares
scientific article; zbMATH DE number 2170410
scientific article; zbMATH DE number 3887704
Constrained completion of partial Latin squares
Completions of $\epsilon $-dense partial Latin squares
scientific article; zbMATH DE number 2170449
On Completing Latin Squares
scientific article; zbMATH DE number 1529466

Cites work

scientific article; zbMATH DE number 16256 (Why is no real title available?)
scientific article; zbMATH DE number 3565005 (Why is no real title available?)
scientific article; zbMATH DE number 3623576 (Why is no real title available?)
scientific article; zbMATH DE number 3352656 (Why is no real title available?)
A Combinatorial Theorem with an Application to Latin Rectangles
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Distinct representatives of subsets
Embedding partial Steiner triple systems is NP-complete
Graph theory
On Representatives of Subsets
Systems of Distinct Representations and Linear Programming
The NP-Completeness of Some Edge-Partition Problems

Cited in

(51)

An improved approximation algorithm for the partial Latin square extension problem.
On the completability of incomplete Latin squares
Avoiding and extending partial edge colorings of hypercubes
Reliable assignments of processors to tasks and factoring on matroids
A characterization of odd-hole inequalities related to Latin squares
Randomized post-optimization of covering arrays
A Latin square autotopism secret sharing scheme
On avoiding some families of arrays
Flexibility of triangle‐free planar graphs
A Bayesian approach to tackling hard computational problems. (Preliminary report)
On completing latin squares
Triangulations of 3-way regular tripartite graphs of degree 4, with applications to orthogonal latin squares
Completing partial Latin squares with one nonempty row, column, and symbol
scientific article; zbMATH DE number 3873343 (Why is no real title available?)
Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
Exploring the complexity boundary between coloring and list-coloring
Extension of some edge graph problems: standard, parameterized and approximation complexity
Computing random $r$-orthogonal Latin squares
List edge multicoloring in graphs with few cycles
Estimating the number of Latin rectangles by the fast simulation method
List-edge-colouring planar graphs with precoloured edges
The fewest clues problem
Completion and deficiency problems
Completion of partial Latin hypercube designs: NP-completeness and inapproximability
Restricted completion of sparse partial Latin squares
Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer
The power of propagation: when GAC is enough
On NP-hardness of the clique partition -- independence number gap recognition and related problems
An effective greedy heuristic for the social golfer problem
An improved SAT formulation for the social golfer problem
On the complexity of certain completion problems
A new algorithm for enumerating all possible Sudoku squares
Characterization of extreme points of multi-stochastic tensors
Exploring the complexity boundary between coloring and list-coloring
A massively parallel evolutionary algorithm for the partial Latin square extension problem
The Sudoku completion problem with rectangular hole pattern is NP-complete
Complexity of token swapping and its variants
Problems from CGCS Luminy, May 2007
A note on the hardness of Skolem-type sequences
A census of critical sets based on non-trivial autotopisms of Latin squares of order up to five
The complexity of constructing gerechte designs
scientific article; zbMATH DE number 7535772 (Why is no real title available?)
Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results
On the completability of incomplete orthogonal Latin rectangles
A randomized tabu search-based approach for perfect stranger matching in economic experiments
Consensus models: computational complexity aspects in modern approaches to the list coloring problem
Cropper's question and Cruse's theorem about partial Latin squares
Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete
scientific article; zbMATH DE number 2170410 (Why is no real title available?)
Approximating latin square extensions

This page was built for publication: The complexity of completing partial Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793029)