Graph burning in community-based networks

DOI10.7155/jgaa.v28i3.2969MaRDI QIDQ6636996

Adele A. Rescigno, Gennaro Cordasco, Luisa Gargano

Publication date: 12 November 2024

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

zbMATH Keywords

approximation algorithmsinfluence spreadgraph burning

Mathematics Subject Classification ID

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

Cites Work

• 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
• Maximum coverage problem with group budget constraints
• 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
• Contagious Sets in Expanders
• Variants of Spreading Messages
• Groups burning: analyzing spreading processes in community-based networks

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