Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem

DOI10.1137/100791130zbMath1221.05210MaRDI QIDQ3013133

Yuan Zhou, Elad Verbin, Leizhen Cai, Yongxi Cheng

Publication date: 18 July 2011

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C90: Applications of graph theory

Related Items

Firefighting as a Strategic Game, 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, A note on the surviving rate of 1-planar graphs, 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 on graph classes, Planar graphs without chordal 5-cycles are 2-good, 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, Asymptotic surviving rate of trees with multiple fire sources, More fires and more fighters