Fighting constrained fires in graphs

DOI10.1016/J.TCS.2012.01.041zbMATH Open1244.05196OpenAlexW2116273603MaRDI QIDQ428868FDOQ428868

Authors: Anthony Bonato, Margaret-Ellen Messinger, 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

Recommendations

• Surviving rate of graphs and firefighter problem
• Surviving rate of graphs and firefighter problem
• Sparse graphs are not flammable
• The surviving rate of a graph for the firefighter problem
• Surviving rates of graphs with bounded treewidth for the firefighter problem

zbMATH Keywords

surviving raterandom regular graphsfirefighterinfinite random graph

Mathematics Subject Classification ID

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

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Expander graphs and their applications
• Title not available (Why is that?)
• Explicit construction of linear sized tolerant networks
• Surviving rates of graphs with bounded treewidth for the firefighter problem
• The surviving rate of a graph for the firefighter problem
• The Firefighter problem: a survey of results, directions and questions
• Title not available (Why is that?)
• Sparse graphs are not flammable
• The surviving rate of an infected network
• The firefighter problem for cubic graphs
• Asymmetric graphs
• Firefighting on trees: How bad is the greedy algorithm?
• A proof of Alon’s second eigenvalue conjecture and related problems
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Fire containment in grids of dimension three and higher
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• The cop density of a graph
• On a pursuit game on Cayley graphs

Cited In (11)

• Surviving rate of graphs and firefighter problem
• Firefighting on trees
• Firefighting on a random geometric graph
• Fire Containment in Planar Graphs
• Firefighting as a strategic game
• Sparse graphs are not flammable
• Firefighting on trees and Cayley graphs
• The firefighter problem: empirical results on random graphs
• Surviving rate of graphs and firefighter problem
• The spread of fire on a random multigraph
• Title not available (Why is that?)

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

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