Fire containment in grids of dimension three and higher
| dc.creator | Develin, Mike | |
| dc.creator | Hartke, Stephen G. | |
| dc.date | 2004-09-13 | |
| dc.date.accessioned | 2026-07-07T05:12:04Z | |
| dc.date.available | 2026-07-07T05:12:04Z | |
| dc.description | We consider a deterministic discrete-time model of fire spread introduced by Hartnell [1995] and the problem of minimizing the number of burnt vertices when deploying a limited number of firefighters per timestep. We consider the process occurring on the d-dimensional square lattice for d>=3, and we prove several results, including two conjectures of Wang and Moeller [2002]. | |
| dc.description | 15 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0409195 | |
| dc.identifier | http://arxiv.org/abs/math/0409195 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/72451 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C75, 90C35 | |
| dc.title | Fire containment in grids of dimension three and higher | |
| dc.type | text |