The Surviving Rate of a Graph for the Firefighter Problem

DOI10.1137/070700395zbMath1207.05098MaRDI 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

tree; outerplanar graph; firefighter problem; surviving rate; Halin graph

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C90: Applications of graph theory

Related Items

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