A Fast and Effective Heuristic for Discovering Small Target Sets in Social Networks
From MaRDI portal
Publication:3467846
DOI10.1007/978-3-319-26626-8_15zbMath1390.91263OpenAlexW2293971114MaRDI QIDQ3467846
Adele A. Rescigno, Marco Mecchia, Gennaro Cordasco, Luisa Gargano, Ugo Vaccaro
Publication date: 5 February 2016
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_15
Analysis of algorithms (68W40) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Dual domination problems in graphs, Discovering small target sets in social networks: a fast and effective algorithm, Parameterized complexity of immunization in the threshold model, Immunization in the threshold model: a parameterized complexity study, Pervasive domination, Whom to befriend to influence people, Evangelism in Social Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Irreversible conversion of graphs
- Some results on the target set selection problem
- 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
- On the Approximability of Influence in Social Networks
- Constant Thresholds Can Make Target Set Selection Tractable
- Parameterized Approximability of Maximizing the Spread of Influence in Networks
- Target Set Selection Problem for Honeycomb Networks
- Contagious Sets in Expanders
- Automata, Languages and Programming
- Variants of Spreading Messages
