Asymptotic surviving rate of trees with multiple fire sources

DOI10.1016/j.dam.2014.10.031zbMath1311.05124OpenAlexW1995510038MaRDI QIDQ2341747

Simone Dantas, Vitor Costa, Dieter Rautenbach

Publication date: 28 April 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.031

zbMATH Keywords

surviving ratefirefighter game

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Surviving rate of graphs and firefighter problem

Cites Work

• Unnamed Item
• Unnamed Item
• Slash and burn on graphs -- firefighting with general weights
• Firefighting on square, hexagonal, and triangular grids
• The surviving rate of an infected network
• The 2-surviving rate of planar graphs without 4-cycles
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• The surviving rate of planar graphs
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• More fires and more fighters
• Fire containment in grids of dimension three and higher
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
• Sparse Graphs Are Not Flammable