Upper bounds and approximation results for the \(k\)-slow burning problem
DOI10.1016/j.dam.2024.11.025MaRDI QIDQ6671389
Michaela Hiller, Philipp Pabst, Arie M. C. A. Koster
Publication date: 27 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Social networks; opinion dynamics (91D30) Trees (05C05) Applications of graph theory (05C90) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Games on graphs (graph-theoretic aspects) (05C57)
This page was built for publication: Upper bounds and approximation results for the \(k\)-slow burning problem
