The firefighter problem for cubic graphs

From MaRDI portal
Publication:960975

DOI10.1016/j.disc.2009.05.007zbMath1216.05107OpenAlexW2015784652MaRDI QIDQ960975

Gary MacGillivray, Andrew D. King

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.05.007



Related Items

The 2-surviving rate of planar graphs without 5-cycles, Surviving rate of graphs and firefighter problem, The firefighter problem: empirical results on random graphs, Finding exact solutions for the geometric firefighter problem in practice, Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment, Fire Containment in Planar Graphs, The Firefighter Problem: A Structural Analysis, The surviving rate of digraphs, Multi-layered planar firefighting, A matheuristic for the firefighter problem on graphs, The surviving rate of an outerplanar graph for the firefighter problem, 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, Unnamed Item, Unnamed Item, Continuous Firefighting on Infinite Square Grids, Firefighting on the hexagonal grid, Planar graphs without chordal 5-cycles are 2-good, A note on the surviving rate of 1-planar graphs, Solving the geometric firefighter routing problem via integer programming, The firefighter problem: further steps in understanding its complexity, 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, On structural parameterizations of firefighting, The surviving rate of planar graphs, On perturbation resilience of non-uniform \(k\)-center, Unnamed Item, Firefighting as a Strategic Game, Asymptotic surviving rate of trees with multiple fire sources



Cites Work