相关论文: Fire containment in grids of dimension three and h…
The Firefighter Problem (FP) is a graph problem originally introduced in 1995 to model the spread of a fire in a graph, which has attracted considerable attention in the literature. The goal is to devise a strategy to employ a given…
In this article, we study Hartnell's Firefighter Problem through the group theoretic notions of growth and quasi-isometry. A graph has the $n$-containment property if for every finite initial fire, there is a strategy to contain the fire by…
The firefighter game problem on locally finite connected graphs was introduced by Bert Hartnell. The game on a graph $G$ can be described as follows: let $f_n$ be a sequence of positive integers; an initial fire starts at a finite set of…
The critical dimension necessary for a flame to propagate in suspensions of fuel particles in oxidizer is studied analytically and numerically. Two types of models are considered: First, a continuum model, wherein the individual particulate…
We propose a discrete two-dimensional mathematical model for forest fires and we derive certain results describing its limiting behavior. We also pose a relevant open question.
Wildfires cause major losses worldwide, and the frequency of fire-weather conditions is likely to increase in many regions. We study the allocation of suppression resources over time on a graph-based representation of a landscape to slow…
The severity of wildfires can be mitigated adopting preventive measures like the construction of firebreaks that are strips of land from which the vegetation is completely removed. In this paper, we model the problem of wildfire containment…
In this paper, we consider the \emph{firefighter problem} on a graph $G=(V,E)$ that is either finite or infinite. Suppose that a fire breaks out at a given vertex $v \in V$. In each subsequent time unit, a firefighter protects one vertex…
Consider a model of fire spreading through a graph; initially some vertices are burning, and at every given time-step fire spreads from burning vertices to their neighbours. The firefighter problem is a solitaire game in which a player is…
Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied…
A two-dimensional model of wildfire spread and merger is presented. Three features affect the fire propagation: (i) a constant basic rate of spread term accounting for radiative and convective heat transfer, (ii) the unidirectional,…
We study the fire-retaining problem on groups, a quasi-isometry invariant introduced by Mart\'inez-Pedroza and Prytula [8], related to the firefighter problem. We prove that any Cayley graph with degree-$d$ polynomial growth does not…
In the last decade, wildfires have become wider and more destructive. The climate change and the growth of urban areas may further increase the probability of incidence of large-scale fires. The risk of fire can be lowered with preventive…
This paper outlines a theoretical approach for predicting the onset of detonation in unconfined turbulent flames which is relevant both to problems of terrestrial combustion and to thermonuclear burning in Type Ia supernovae. Two basic…
The forest fire model is a reaction-diffusion model where energy, in the form of trees, is injected uniformly, and burned (dissipated) locally. We show that the spatial distribution of fires forms a novel geometric structure where the…
We study a model for the destruction of a random network by fire. Suppose that we are given a multigraph of minimum degree at least 2 having real-valued edge-lengths. We pick a uniform point from along the length and set it alight; the…
The firefighter problem is a monotone dynamic process in graphs that can be viewed as modeling the use of a limited supply of vaccinations to stop the spread of an epidemic. In more detail, a fire spreads through a graph, from burning…
Electric power infrastructure faces increasing risk of damage and disruption due to wildfire. Operators of power grids in wildfire-prone regions must consider the potential impacts of unpredictable fires. However, traditional wildfire…
Suppose we have a network that is represented by a graph $G$. Potentially a fire (or other type of contagion) might erupt at some vertex of $G$. We are able to respond to this outbreak by establishing a firebreak at $k$ other vertices of…
Based on complex network theory, we propose a computational methodology that addresses the spatial distribution of fuel breaks for the inhibition of the spread and size of wildland fires on heterogeneous landscapes. This is a two-tire…