Groups burning: analyzing spreading processes in community-based networks

DOI10.1007/978-3-031-27051-2_28MaRDI QIDQ6091176zbMATH OpenFDO

Authors Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno

Publication date 24 November 2023

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-27051-2_28

zbMATH Keywords

burning numbergroup influencespreading processes

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A constant approximation for colorful k-center
• A survey of graph burning
• Active influence spreading in social networks
• Approximation algorithms for graph burning
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Combinatorial model and bounds for target set selection
• Constant thresholds can make target set selection tractable
• Contagious sets in expanders
• Discovering small target sets in social networks: a fast and effective algorithm
• Evangelism in social networks: algorithms and complexity
• Fair colorful k-center clustering
• Fast and frugal targeting with incentives
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• Influence diffusion in social networks under time window constraints
• Integer Programming with Bounded Variables via Canonical Separation
• Latency-bounded target set selection in social networks
• Networks, crowds and markets. Reasoning about a highly connected world.
• Spread of influence in weighted networks under time and budget constraints
• Treewidth governs the complexity of target set selection
• Variants of spreading messages

Cited in

(1)

• Graph burning in community-based networks

This page was built for publication: Groups burning: analyzing spreading processes in community-based networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091176)