Algorithm Design
Fire containment in grids of dimension three and higher
Discrete Applied Mathematics
A generalization of the firefighter problem on z × z
Discrete Applied Mathematics
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The Surviving Rate of a Graph for the Firefighter Problem
SIAM Journal on Discrete Mathematics
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
The surviving rate of planar graphs
Theoretical Computer Science
Fighting constrained fires in graphs
Theoretical Computer Science
The 2-surviving rate of planar graphs without 4-cycles
Theoretical Computer Science
Discrete Applied Mathematics
The 2-surviving rate of planar graphs without 6-cycles
Theoretical Computer Science
A lower bound of the surviving rate of a planar graph with girth at least seven
Journal of Combinatorial Optimization
Hi-index | 0.01 |
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet on fire, and then the fire spreads to all unprotected neighbors of the vertices on fire. The objective of the firefighter is to save as many vertices as possible. The surviving rate of a graph is the average percentage of vertices that can be saved when a fire starts randomly at one vertex of the graph, which measures the defense ability of a graph as a whole. In this paper, we study the surviving rates of graphs with bounded treewidth. We prove that the surviving rate of every $n$-vertex outerplanar graph is at least $1-\Theta(\frac{\log n}{n})$, which is asymptotically tight. We also prove that if $k$ firefighters are available in each round, then the surviving rate of an $n$-vertex graph with treewidth at most $k$ is at least $1-O(\frac{k^{2}\log n}{n})$. Furthermore, we show that the greedy strategy of Hartnell and Li [Congr. Numer., 145 (2000), pp. 187-192] for trees saves at least $1-\Theta(\frac{\log n}{n})$ percent of vertices on average for an $n$-vertex tree. Our results settle a conjecture and two problems of Cai and Wang [SIAM J. Discrete Math., 23 (2009), pp. 1814-1826] in affirmative.