Fighting constrained fires in graphs

DOI10.1016/j.tcs.2012.01.041zbMath1244.05196OpenAlexW2116273603MaRDI QIDQ428868

Margaret-Ellen Messinger, Anthony Bonato, Paweł Prałat

Publication date: 25 June 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.01.041

zbMATH Keywords

random regular graphssurviving ratefirefighterinfinite random graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80)

Related Items (3)

The firefighter problem: empirical results on random graphs ⋮ Firefighting on trees ⋮ Firefighting as a Strategic Game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The surviving rate of an infected network
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• The firefighter problem for cubic graphs
• On a pursuit game on Cayley graphs
• Explicit construction of linear sized tolerant networks
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Fire containment in grids of dimension three and higher
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• Expander graphs and their applications
• A proof of Alon’s second eigenvalue conjecture and related problems
• Sparse Graphs Are Not Flammable
• Asymmetric graphs

This page was built for publication: Fighting constrained fires in graphs