The Surviving Rate of a Graph for the Firefighter Problem

DOI10.1137/070700395zbMath1207.05098OpenAlexW2061068662MaRDI QIDQ3058533

Wang Weifan, Cai Leizhen

Publication date: 3 December 2010

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070700395

zbMATH Keywords

treeouterplanar graphfirefighter problemsurviving rateHalin graph

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Applications of graph theory (05C90)

Related Items (26)

The 2-surviving rate of planar graphs without 5-cycles ⋮ Slash and burn on graphs -- firefighting with general weights ⋮ Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ Fire Containment in Planar Graphs ⋮ The 2-surviving rate of planar graphs without 6-cycles ⋮ The surviving rate of digraphs ⋮ The surviving rate of an outerplanar graph for the firefighter problem ⋮ Fighting constrained fires in graphs ⋮ More fires and more fighters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Firefighting on square, hexagonal, and triangular grids ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Planar graph is on fire ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ A note on the surviving rate of 1-planar graphs ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ The surviving rate of an infected network ⋮ A lower bound of the surviving rate of a planar graph with girth at least seven ⋮ 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 ⋮ Firefighting as a Strategic Game ⋮ Plane graphs of diameter two are 2-optimal

This page was built for publication: The Surviving Rate of a Graph for the Firefighter Problem