Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.dam.2007.08.011
Title: A generalization of the firefighter problem on z × z
Authors: Ng, K.L. 
Raff, P.
Keywords: Containment certificate
Firefighter problem
Graph
Issue Date: 1-Mar-2008
Citation: Ng, K.L., Raff, P. (2008-03-01). A generalization of the firefighter problem on z × z. Discrete Applied Mathematics 156 (5) : 730-745. ScholarBank@NUS Repository. https://doi.org/10.1016/j.dam.2007.08.011
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 frac(3, 2), then a fire starting at any finite number of vertices in the two dimensional infinite grid graph can always be contained. © 2007 Elsevier B.V. All rights reserved.
Source Title: Discrete Applied Mathematics
URI: http://scholarbank.nus.edu.sg/handle/10635/102655
ISSN: 0166218X
DOI: 10.1016/j.dam.2007.08.011
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

16
checked on Nov 20, 2022

WEB OF SCIENCETM
Citations

13
checked on Sep 25, 2021

Page view(s)

85
checked on Nov 24, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.