Graph burning in community-based networks

DOI10.7155/JGAA.V28I3.2969MaRDI QIDQ6636996zbMATH OpenFDO

Authors Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno

Publication date 12 November 2024

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/JGAA.V28I3.2969

zbMATH Keywords

approximation algorithmsgraph burninginfluence spread

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Approximation algorithms (68W25) Games involving graphs (91A43)

Recommendations

• Burning two worlds
• A survey of graph burning
• Approximation algorithms for graph burning
• Burning a graph is hard
• Burning a graph as a model of social contagion

Cites work

• A survey of graph burning
• Active influence spreading in social networks
• Approximation algorithms for graph burning
• 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
• Fast and frugal targeting with incentives
• Groups burning: analyzing spreading processes in community-based networks
• 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
• Maximum coverage problem with group budget constraints
• 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)

• Adversarial graph burning densities

This page was built for publication: Graph burning in community-based networks

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