Related papers: Firefighting on square, hexagonal, and triangular …
Given a graph $G=(V, E)$, the problem of Graph Burning is to find a sequence of nodes from $V$, called a burning sequence, to burn the whole graph. This is a discrete-step process, and at each step, an unburned vertex is selected as an…
A set of vertices $S$ \emph{resolves} a graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of a graph $G$ is the minimum cardinality of a resolving set. In this…
The burning number $b(G)$ of a graph $G$ is the smallest number of turns required to burn all vertices of a graph if at every turn a new fire is started and existing fires spread to all adjacent vertices. The Burning Number Conjecture of…
Fire propagation is a major concern in the world in general and in Argentinian northwestern Patagonia in particular where every year hundreds of hectares are affected by both natural and anthropogenic forest fires. We developed an efficient…
Let $G=(V(G),E(G))$ be a graph with vertex set $V(G)$ and edge set $E(G)$. The resistance distance $R_G(x,y)$ between two vertices $x,y$ of $G$ is defined to be the effective resistance between the two vertices in the corresponding…
For a graph $H$ whose edges are coloured blue or red, the $H$-semi-inducibility problem asks for the maximum, over all graphs $G$ of given order $n$, of the number of injections from the vertex set of $H$ into the vertex set of $G$ that…
Chip-firing is a combinatorial game played on a graph in which we place and disperse chips on vertices until a stable state is reached. We study a chip-firing variant played on an infinite rooted directed $k$-ary tree, where we place…
This work introduces two techniques for the design and analysis of branching algorithms, illustrated through the case study of the Vertex Cover problem. First, we present a method for automatically generating branching rules through a…
Given a graph $G$, an identifying code $C \subseteq V(G)$ is a vertex set such that for any two distinct vertices $v_1,v_2\in V(G)$, the sets $N[v_1]\cap C$ and $N[v_2]\cap C$ are distinct and nonempty (here $N[v]$ denotes a vertex $v$ and…
We consider a variant of the Cops and Robber game, in which the robber has unbounded speed, i.e. can take any path from her vertex in her turn, but she is not allowed to pass through a vertex occupied by a cop. Let c_{infty}(G) denote the…
Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…
The firefighter problem is NP-hard and admits a $(1-1/e)$ approximation based on rounding the canonical LP. In this paper, we first show a matching integrality gap of $(1-1/e+\epsilon)$ on the canonical LP. This result relies on a powerful…
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…
Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice. Furthermore, the study of \emph{fairness} in Algorithmic Design and Machine Learning has recently received…
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the gain function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $ and its inverse is assigned to the opposite…
The frog model is a system of interacting random walks. Initially, there is one particle at each vertex of a connected graph $\mathcal{G}$. All particles are inactive at time zero, except for the one which is placed at the root of…
The burning number of a graph can be used to measure the spreading speed of contagion in a network. The burning number conjecture is arguably the main unresolved conjecture related to this graph parameter, which can be settled by showing…
We abstract and study \emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G = (V, E)$ and a set of \emph{demand pairs} $P \subseteq V \times V$, a…
We prove upper and lower bounds on the size of the largest square grid graph that is a subgraph, minor, or shallow minor of a graph in the form of a larger square grid from which a specified number of vertices have been deleted. Our bounds…
We consider a variant of Cops and Robbers in which the robber may traverse as many edges as he likes in each turn, with the constraint that he cannot pass through any vertex occupied by a cop. We study this model on several classes of…