Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
420655 | Discrete Applied Mathematics | 2008 | 16 Pages |
Abstract
We consider a generalization of the firefighter problem where the number of firefighters available per time step t is not a constant. We show that if the number of firefighters available is periodic in t and the average number per time period exceeds 32, then a fire starting at any finite number of vertices in the two dimensional infinite grid graph can always be contained.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
K.L. Ng, P. Raff,