Hardness of r-dominating set on Graphs of Diameter (r + 1)

DOI10.1007/978-3-319-03898-8_22zbMath1406.68042MaRDI QIDQ2867088

M. S. Ramanujan, Saket Saurabh, Daniel Lokshtanov, Geevarghese Philip, Neeldhara Misra

Publication date: 10 December 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_22

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)