Domino Tatami Covering Is NP-Complete

DOI10.1007/978-3-642-45278-9_13zbMath1408.05031arXiv1305.6669OpenAlexW1583070323WikidataQ29026101 ScholiaQ29026101MaRDI QIDQ2870023

Frank Ruskey, Alejandro Erickson

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.6669

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

\(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) ⋮ Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees

This page was built for publication: Domino Tatami Covering Is NP-Complete