On Tractable Cases of Target Set Selection

DOI10.1007/978-3-642-17517-6_34zbMath1310.68115MaRDI QIDQ3060749

Rolf Niedermeier, Mathias Weller, André Nichterlein, Johannes Uhlmann

Publication date: 9 December 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_34

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C82: Small world graphs, complex networks (graph-theoretic aspects)

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