Planar Capacitated Dominating Set Is W[1]-Hard

DOI10.1007/978-3-642-11269-0_4zbMath1273.68145WikidataQ59567702 ScholiaQ59567702MaRDI QIDQ3656850

Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx

Publication date: 14 January 2010

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_4

Mathematics Subject Classification ID

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

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