The Parameterized Complexity of the Unique Coverage Problem

DOI10.1007/978-3-540-77120-3_54zbMath1193.68139MaRDI QIDQ5387796

Venkatesh Raman, Somnath Sikdar, Hannes Moser

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_54

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)