Evangelism in Social Networks

DOI10.1007/978-3-319-44543-4_8zbMath1478.91147OpenAlexW2524514779MaRDI QIDQ2819494

Adele A. Rescigno, Gennaro Cordasco, Ugo Vaccaro, Luisa Gargano

Publication date: 29 September 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-44543-4_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Social networks; opinion dynamics (91D30) Marketing, advertising (90B60) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (3)

Discovering small target sets in social networks: a fast and effective algorithm ⋮ Immunization in the threshold model: a parameterized complexity study ⋮ Active influence spreading in social networks

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial model and bounds for target set selection
• Treewidth governs the complexity of target set selection
• Complexity of conflict-free colorings of graphs
• Irreversible conversion of graphs
• Contagious sets in dense graphs
• Algorithmic meta-theorems for restrictions of treewidth
• Some results on the target set selection problem
• Parameterized approximability of maximizing the spread of influence in networks
• Constant thresholds can make target set selection tractable
• Influence diffusion in social networks under time window constraints
• Spread of influence in weighted networks under time and budget constraints
• Latency-bounded target set selection in social networks
• On Tractable Cases of Target Set Selection
• A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
• On the Approximability of Influence in Social Networks
• Contagious Sets in Expanders
• Variants of Spreading Messages

This page was built for publication: Evangelism in Social Networks