Log In Sign Up

Multi-layered planar firefighting

by   Arye Deutch, et al.

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 allowed, at every time-step, to protect some non-burning vertices (by effectively deleting them) in order to contain the fire growth. How many vertices per turn, on average, must be protected in order to stop the fire from spreading infinitely? Here we consider the problem on ℤ^2× [h] for both nearest neighbour adjacency and strong adjacency. We determine the critical protection rates for these graphs to be 1.5h and 3h, respectively. This establishes the fact that using an optimal two-dimensional strategy for all layers in parallel is asymptotically optimal.


page 1

page 2

page 3

page 4


Adjacency Labelling for Planar Graphs (and Beyond)

We show that there exists an adjacency labelling scheme for planar graph...

The Pyro game: a slow intelligent fire

In the Firefighter problem, a fire breaks out at a vertex of a graph and...

Shorter Labeling Schemes for Planar Graphs

An adjacency labeling scheme for a given class of graphs is an algorithm...

On Adjacency and e-adjacency in General Hypergraphs: Towards an e-adjacency Tensor

Adjacency between two vertices in graphs or hypergraphs is a pairwise re...

On Adjacency and e-Adjacency in General Hypergraphs: Towards a New e-Adjacency Tensor

In graphs, the concept of adjacency is clearly defined: it is a pairwise...

Non-existence of annular separators in geometric graphs

Benjamini and Papasoglou (2011) showed that planar graphs with uniform p...

Discovering Bands from Graphs

Discovering the underlying structure of a given graph is one of the fund...