Skip to Main content Skip to Navigation
Journal articles

Orienting edges to fight fire in graphs

Julien Bensmail 1 Nick Brettell 2
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01166577
Contributor : Julien Bensmail <>
Submitted on : Friday, March 2, 2018 - 4:45:20 PM
Last modification on : Tuesday, December 8, 2020 - 10:24:07 AM
Long-term archiving on: : Thursday, May 31, 2018 - 7:50:53 PM

File

firefight.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01166577, version 2

Collections

Citation

Julien Bensmail, Nick Brettell. Orienting edges to fight fire in graphs. The Australasian Journal of Combinatorics, Combinatorial Mathematics Society of Australasia (Inc.), 2018, 71 (1), pp.12-42. ⟨hal-01166577v2⟩

Share

Metrics

Record views

465

Files downloads

134