Groups burning: analyzing spreading processes in community-based networks
From MaRDI portal
Publication:6091176
DOI10.1007/978-3-031-27051-2_28MaRDI QIDQ6091176
Luisa Gargano, Adele A. Rescigno, Gennaro Cordasco
Publication date: 24 November 2023
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial model and bounds for target set selection
- Treewidth governs the complexity of target set selection
- Discovering small target sets in social networks: a fast and effective algorithm
- Active influence spreading in social networks
- Constant thresholds can make target set selection tractable
- Whom to befriend to influence people
- Fast and frugal targeting with incentives
- Approximation algorithms for graph burning
- 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
- Integer Programming with Bounded Variables via Canonical Separation
- Evangelism in social networks: Algorithms and complexity
- A survey of graph burning
- Fair Colorful k-Center Clustering
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Contagious Sets in Expanders
- Variants of Spreading Messages
This page was built for publication: Groups burning: analyzing spreading processes in community-based networks
