相关论文: 3/2 Firefighters are not enough
The problem Defensive $\delta$-Covering, for some covering range $\delta > 0$, is a continuous facility location problem on undirected graphs where all edges have unit length. It is a generalization of Defensive Dominating Set and…
Motivated by the controller placement problems in software-defined networks and the fair division principles of classical "cake cutting", we investigate the following two-player zero-sum game. In our model, a defender places a limited…
A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves.…
A planar herding problem is considered, where a superior pursuer herds a flock of non-cooperative, inferior evaders around a predefined target point. An inverse square law of repulsion is assumed between the pursuer and each evader. Two…
The burning number of a graph $G$ is the smallest positive integer $k$ such that the vertex set of $G$ can be covered with balls of radii $0, 1, \dots, k-1$. A well-known conjecture by Bonato, Janssen and Roshabin states that any connected…
In wildfires, burning pieces of ember-firebrands-are carried downstream by wind. At the time of landing, these firebrands can start secondary fires far away from the main burning unit. This phenomenon is called spotting and the secondary…
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…
Human diseases spread over networks of contacts between individuals and a substantial body of recent research has focused on the dynamics of the spreading process. Here we examine a model of two competing diseases spreading over the same…
We consider problems of the following type: given a graph $G$, how many edges are needed in the worst case for a sparse subgraph $H$ that approximately preserves distances between a given set of node pairs $P$? Examples include pairwise…
The spread of an epidemic is often modeled by an SIR random process on a social network graph. The MinINF problem for optimal social distancing involves minimizing the expected number of infections, when we are allowed to break at most $B$…
The purpose of this tutorial is to help individuals use the \underline{FireCommander} game environment for research applications. The FireCommander is an interactive, probabilistic joint perception-action reconnaissance environment in which…
Given a graph $G$, guards are placed on vertices of $G$. Then vertices are subject to an infinite sequence of attacks so that each attack must be defended by a guard moving from a neighboring vertex. The m-eternal domination number is the…
$k$-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on vertices of cardinality bounded by a parameter $k$. The problem…
Covering all edges of a graph by a small number of vertices, this is the NP-complete Vertex Cover problem. It is among the most fundamental graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of…
Panic may spread over a crowd in a similar fashion as contagious diseases do in social groups. People no exposed to a panic source may express fear, alerting others of imminent danger. This social mechanism initiates an evacuation process,…
Understanding the dynamics of wildfire is crucial for developing management and intervention strategies. Mathematical and computational models can be used to improve our understanding of wildfire processes and dynamics. This paper presents…
We study a variant of the chip-firing game called the diffusion game. In the diffusion game, we begin with some integer labelling of the vertices of a graph, interpreted as a number of chips on each vertex, and then for each subsequent step…
We study the computability and complexity of the exploration problem in a class of highly dynamic graphs: periodically varying (PV) graphs, where the edges exist only at some (unknown) times defined by the periodic movements of carriers.…
Given a social network represented by a graph $G$, we consider the problem of finding a bounded cardinality set of nodes $S$ with the property that the influence spreading from $S$ in $G$ is as large as possible. The dynamics that govern…
Forest fires pose a natural threat with devastating social, environmental, and economic implications. The rapid and highly uncertain rate of spread of wildfires necessitates a trustworthy digital tool capable of providing real-time…