Variants of Spreading Messages

DOI10.7155/jgaa.00244zbMath1276.05119OpenAlexW2093340343MaRDI QIDQ5891345

C. Pandu Rangan, T. V. Thirumala Reddy

Publication date: 28 November 2013

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00244

zbMATH Keywords

cardinality of the min-seed for undirected graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (15)

Discovering small target sets in social networks: a fast and effective algorithm ⋮ Optimizing Spread of Influence in Social Networks via Partial Incentives ⋮ On the harmless set problem parameterized by treewidth ⋮ A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks ⋮ Groups burning: analyzing spreading processes in community-based networks ⋮ Latency-bounded target set selection in social networks ⋮ Active influence spreading in social networks ⋮ Parameterized approximability of maximizing the spread of influence in networks ⋮ Whom to befriend to influence people ⋮ Fast and frugal targeting with incentives ⋮ Evangelism in Social Networks ⋮ The complexity of finding harmless individuals in social networks ⋮ 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

This page was built for publication: Variants of Spreading Messages