scientific article
From MaRDI portal
Publication:3614015
zbMath1179.05112MaRDI QIDQ3614015
Gary MacGillivray, Stephen Finbow
Publication date: 16 March 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexityopen problemsfirefighter problemalgoritmsexpected damagefire on infinite gridsmaximum damage
Related Items (68)
Firefighting on trees and Cayley graphs ⋮ The 2-surviving rate of planar graphs without 5-cycles ⋮ Parameterized Complexity of Firefighting Revisited ⋮ Burning grids and intervals ⋮ Slash and burn on graphs -- firefighting with general weights ⋮ Surviving rate of graphs and firefighter problem ⋮ Unnamed Item ⋮ A survey of graph burning ⋮ Parameterized complexity of immunization in the threshold model ⋮ The firefighter problem: empirical results on random graphs ⋮ A new model and algorithms in firefighting theory ⋮ Reconfiguration graphs of shortest paths ⋮ Fire Containment in Planar Graphs ⋮ Deleting edges to restrict the size of an epidemic in temporal networks ⋮ Burning a graph is hard ⋮ The 2-surviving rate of planar graphs without 6-cycles ⋮ The surviving rate of digraphs ⋮ Multi-layered planar firefighting ⋮ Establishing herd immunity is hard even in simple geometric networks ⋮ The firebreak problem ⋮ A matheuristic for the firefighter problem on graphs ⋮ Immunization in the threshold model: a parameterized complexity study ⋮ On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms ⋮ Burning and \(w\)-burning of geometric graphs ⋮ The firefighter problem on graph classes ⋮ The surviving rate of an outerplanar graph for the firefighter problem ⋮ Coarse geometry of the fire retaining property and group splittings ⋮ On the predictability of the abelian sandpile model ⋮ Approximability of the firefighter problem. Computing cuts over time ⋮ Fighting constrained fires in graphs ⋮ The firefighter problem with more than one firefighter on trees ⋮ New Integrality Gap Results for the Firefighters Problem on Trees ⋮ More fires and more fighters ⋮ Firefighting on square, hexagonal, and triangular grids ⋮ On a Fire Fighter’s Problem ⋮ Continuous Firefighting on Infinite Square Grids ⋮ Parameterized complexity of firefighting ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Estimation of Distribution Algorithms for the Firefighter Problem ⋮ Firefighting on the hexagonal grid ⋮ Planar graph is on fire ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ The coarse geometry of Hartnell's firefighter problem on infinite graphs ⋮ A note on the surviving rate of 1-planar graphs ⋮ The firefighter problem for cubic graphs ⋮ Burning graphs: a probabilistic perspective ⋮ The surviving rate of an infected network ⋮ A lower bound of the surviving rate of a planar graph with girth at least seven ⋮ The 2-surviving rate of planar graphs without 4-cycles ⋮ Burning numbers of path forests and spiders ⋮ Unnamed Item ⋮ Burning number of theta graphs ⋮ On efficient vaccine distribution strategy to suppress pandemic using social relation ⋮ Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly ⋮ Reconfiguring vertex colourings of 2-trees ⋮ On structural parameterizations of firefighting ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ The surviving rate of planar graphs ⋮ Unnamed Item ⋮ Multilevel Approaches for the Critical Node Problem ⋮ Iterated local search for the placement of wildland fire suppression resources ⋮ Firefighting on trees ⋮ Approximation algorithms for the geometric firefighter and budget fence problems ⋮ Firefighting on a random geometric graph ⋮ How to Burn a Graph ⋮ Firefighting as a Strategic Game ⋮ Asymptotic surviving rate of trees with multiple fire sources ⋮ Approximation algorithms for fragmenting a graph against a stochastically-located threat
This page was built for publication:
