Exact solutions for latency-bounded target set selection problem on some special families of graphs
From MaRDI portal
Publication:260041
DOI10.1016/j.dam.2015.09.005zbMath1332.05137OpenAlexW2193891334MaRDI QIDQ260041
Wei Wang, Zishen Yang, Xianliang Liu
Publication date: 18 March 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.09.005
Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items
The \(t\)-latency bounded strong target set selection problem in some kinds of special family of graphs, Whom to befriend to influence people, Fast and frugal targeting with incentives
Cites Work
- Unnamed Item
- On dynamic monopolies of graphs with general thresholds
- Combinatorial model and bounds for target set selection
- On dynamic monopolies of graphs: the average and strict majority thresholds
- Treewidth governs the complexity of target set selection
- Recent developments on graphs of bounded clique-width
- Local majorities, coalitions and monopolies in graphs: A review
- On time versus size for monotone dynamic monopolies in regular topologies
- Some results on the target set selection problem
- Bounding the Number of Tolerable Faults in Majority-Based Systems
- On the Approximability of Influence in Social Networks
- Constant Thresholds Can Make Target Set Selection Tractable
- Target Set Selection Problem for Honeycomb Networks
- Latency-Bounded Target Set Selection in Social Networks
- Automata, Languages and Programming
