Abstract

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.

MSC codes

  1. 05C35
  2. 05C90

Keywords

  1. firefighter problem
  2. surviving rate
  3. tree
  4. treewidth
  5. outerplanar graph

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
L. Cai, E. Verbin, and L. Yang, Firefighting on tres: $(1-1/e)$-approximation, fixed parameter tractability and a subexponential algorithm, in Algorithms and Computation, Lecture Notes in Comput. Sci. 5369, 2008, pp. 258–269.
2.
L. Cai and W. Wang, The surviving rate of a graph for the firefighter problem, SIAM J. Discrete Math., 23 (2009), pp. 1814–1826.
3.
M. Develin and S. G. Hartke, Fire containment in grids of dimension three and higher, Discrete Appl. Math., 155 (2007), pp. 2257–2268.
4.
S. Finbow, B. Hartnell, Q. Li, and K. Schmeisser, On minimizing the effects of fire or a virus on a network, J. Combin. Math. Combin. Comput., 33 (2000), pp. 311–322.
5.
S. Finbow, A. King, G. MacGillivray, and R. Rizzi, The firefighter problem for graphs of maximum degree three, Discrete Math., 307 (2007), pp. 2094–2105.
6.
S. Finbow and G. MacGillivray, The firefighter problem: A survey of results, directions and questions, Austral. J. Combin., 43 (2009), pp. 57–78.
7.
P. Fogarty, Catching the fire on grids, M.Sc. thesis, University of Vermont, Burlington, VT, 2003.
8.
B. Hartnell, Firefighter! An application of domination, presentation in the 25th Manitoba Conference on Combinatorial Mathematics and Computing, University of Manitoba in Winnipeg, Canada, 1995.
9.
B. Hartnell and Q. Li, Firefighting on trees: How bad is the greedy algorithm? Congr. Numer., 145 (2000), pp. 187–192.
10.
J. Kleinberg and E. Tardos, Algorithm Design, Addison–Wesley, Reading, MA, 2005.
11.
G. MacGillivray and P. Wang, On the firefighter problem, J. Combin. Math. Combin. Comput., 47 (2003), pp. 83–96.
12.
K. L. Ng and P. Raff, A generalization of the firefighter problem on $z\times z$, Discrete Appl. Math., 156 (2008), pp. 730–745.
13.
N. Robertson and P. D. Seymour, Graph minors. I. Excluding a forest, J. Combin. Theory Ser. B, 35 (1983), pp. 39–61.
14.
A. Scott, U. Stege, and N. Zeh, Politician's firefighting, in Algorithms and Computation, Lecture Notes in Comput. Sci. 4288, 2006, pp. 608–617.
15.
P. Wang and S. A. Moeller, Fire control on graphs, J. Combin. Math. Combin. Comput., 41 (2002), pp. 19–34.

Information & Authors

Information

Published In

cover image SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Pages: 1322 - 1335
ISSN (online): 1095-7146

History

Submitted: 5 April 2010
Accepted: 29 July 2010
Published online: 12 October 2010

MSC codes

  1. 05C35
  2. 05C90

Keywords

  1. firefighter problem
  2. surviving rate
  3. tree
  4. treewidth
  5. outerplanar graph

Authors

Affiliations

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

View Options

View options

PDF

View PDF

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media

The SIAM Publications Library now uses SIAM Single Sign-On for individuals. If you do not have existing SIAM credentials, create your SIAM account https://my.siam.org.