Latency-Bounded Target Set Selection in Social Networks

DOI10.1007/978-3-642-39053-1_8zbMath1390.91262OpenAlexW3021250664MaRDI QIDQ5326360

Gennaro Cordasco, Martin Milanič, Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro

Publication date: 5 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_8

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30)

Related Items (9)

(Total) vector domination for graphs with bounded branchwidth ⋮ Subexponential Fixed-Parameter Algorithms for Partial Vector Domination ⋮ How to choose friends strategically ⋮ Whom to befriend to influence people ⋮ Fast and frugal targeting with incentives ⋮ Influence diffusion in social networks under time window constraints ⋮ Influence Diffusion in Social Networks under Time Window Constraints ⋮ On the complexity of the vector connectivity problem ⋮ Exact solutions for latency-bounded target set selection problem on some special families of graphs

This page was built for publication: Latency-Bounded Target Set Selection in Social Networks