Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
From MaRDI portal
Publication:3013133
DOI10.1137/100791130zbMath1221.05210OpenAlexW1979983781MaRDI 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
Related Items
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, The 2-surviving rate of planar graphs without 6-cycles, The surviving rate of digraphs, The firefighter problem on graph classes, Fighting constrained fires in graphs, More fires and more fighters, Unnamed Item, Firefighting on square, hexagonal, and triangular grids, Planar graphs without chordal 5-cycles are 2-good, A note on the surviving rate of 1-planar graphs, 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, Asymptotic surviving rate of trees with multiple fire sources, Plane graphs of diameter two are 2-optimal