The firefighter problem for regular infinite directed grids

Biebighauser, Daniel P.; Holte, Lise; Wagner, R. Harrison

doi:10.2140/involve.2012.5.393

Cited by 2 publications

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. Towards Conjecture 5.13, we now consider infinite planar grids, which received some attention for both the directed and undirected versions of the Firefighter Problem [1,8]. In particular, the strategies described below could be useful for dealing with the general case.…”

Section: Partial K-treesmentioning

confidence: 99%

“…This problem has gained increasing attention since its introduction; see [4] for a comprehensive survey. Some investigations into directed versions have also been conducted recently [1,7], where the fire propagates from a burnt vertex only through its outgoing incident arcs. As noted in [4], this directed version is, in a sense, at least as difficult as the undirected version, since there exists an orientation for any undirected graph in which the fire propagates as in the undirected version.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Orienting edges to fight fire in graphs

Bensmail,

Brettell

2015

Preprint

View full text Add to dashboard Cite

We investigate a new oriented variant of the Firefighter Problem. In the traditional Firefighter Problem, a fire breaks out at a given vertex of a graph, and at each time interval spreads to neighbouring vertices that have not been protected, while a constant number of vertices are protected at each time interval. In the version of the problem considered here, the firefighters are able to orient the edges of the graph before the fire breaks out, but the fire could start at any vertex. We consider this problem when played on a graph in one of several graph classes, and give upper and lower bounds on the number of vertices that can be saved. In particular, when one firefighter is available at each time interval, and the given graph is a complete graph, or a complete bipartite graph, we present firefighting strategies that are provably optimal. We also provide lower bounds on the number of vertices that can be saved as a function of the chromatic number, of the maximum degree, and of the treewidth of a graph. For a subcubic graph, we show that the firefighters can save all but two vertices, and this is best possible.

show abstract

Section: Partial K-treesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%