Constant Thresholds Can Make Target Set Selection Tractable

DOI10.1007/978-3-642-34862-4_9zbMath1319.68108OpenAlexW2058157772MaRDI QIDQ4916038

Morgan Chopin, Rolf Niedermeier, Mathias Weller, André Nichterlein

Publication date: 19 April 2013

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

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.377.3067

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ Complexity analysis of \(P_3\)-convexity problems on bounded-degree and planar graphs ⋮ Latency-bounded target set selection in social networks ⋮ Parameterized approximability of maximizing the spread of influence in networks ⋮ Fast and frugal targeting with incentives ⋮ Influence diffusion in social networks under time window constraints ⋮ Spread of influence in weighted networks under time and budget constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs

This page was built for publication: Constant Thresholds Can Make Target Set Selection Tractable