Related papers: A Fire Fighter's Problem
In 2006, Alberto Bressan suggested the following problem. Suppose a circular fire spreads in the Euclidean plane at unit speed. The task is to build, in real time, barrier curves to contain the fire. At each time $t$ the total length of all…
In this paper we address the problem for blocking fire by constructing a wall $\zeta$ whose shape is spiral-like. This is supposed to be the best strategy when a single firefighter is constructing the wall with a finite construction speed…
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…
In the classic version of the game of firefighter, on the first turn a fire breaks out on a vertex in a graph $G$ and then $k$ firefighters protect $k$ vertices. On each subsequent turn, the fire spreads to the collective unburnt…
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…
In the classic version of the game of firefighter, on the first turn a fire breaks out on a vertex in a graph $G$ and then $b$ firefighters protect $b$ vertices. On each subsequent turn, the fire spreads to the collective unburned…
The paper studies a dynamic blocking problem, motivated by a model of optimal fire confinement. While the fire can expand with unit speed in all directions, barriers are constructed in real time. An optimal strategy is sought, minimizing…
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…
This paper investigates the steady axisymmetric structure of the cold boundary-layer flow surrounding fire whirls developing over localized fuel sources lying on a horizontal surface. The inviscid swirling motion found outside the boundary…
The Firefighter problem is to place firefighters on the vertices of a graph to prevent a fire with known starting point from lighting up the entire graph. In each time step, a firefighter may be permanently placed on an unburned vertex and…
Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire breaks out at a vertex, and the fire spreads to all vertices…
We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and firefighters can be…
The Firefighter problem and a variant of it, known as Resource Minimization for Fire Containment (RMFC), are natural models for optimal inhibition of harmful spreading processes. Despite considerable progress on several fronts, the…
The problem of linear stability of confined V-flames with arbitrary gas expansion is addressed. Using the on-shell description of flame dynamics, a general equation governing propagation of disturbances of an anchored flame is obtained.…
For certain values of the wave speed parameter, evolution equations for the temperature of a region of fuel admit traveling wave solutions describing fire fronts. We consider such a system in the form of a nonlinear reaction-diffusion…
In the Firefighter problem, introduced by Hartnell in 1995, a fire spreads through a graph while a player chooses which vertices to protect in order to contain it. In this paper, we focus on the case of trees and we consider as well the…
We build in this paper a numerical solution procedure to compute the flow induced by a spherical flame expanding from a point source at a constant expansion velocity, with an instantaneous chemical reaction. The solution is supposed to be…
It is well known that fighting a fire is a hard task. The Firefighter problem asks how to optimally deploy firefighters to defend the vertices of a graph from a fire. This problem is NP-Complete on all but a few classes of graphs.…
Smoke curtains are typically used in public-access buildings in connexion with ventilation effects without considering a crossed design. This paper aims to understand the fire smoke behaviour in the context of the interaction between…
Propagation of premixed flames having thick reaction zones in rapidly-varying, small-scale, zero-mean, spatio-temporal periodic flows is considered. Techniques of large activation energy asymptotics and homogenization theory are used to…