Publication:4457546
From MaRDI portal
zbMath1038.05026MaRDI QIDQ4457546
Publication date: 25 March 2004
05C05: Trees
05C35: Extremal problems in graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On structural parameterizations of firefighting, Firefighting as a Strategic Game, Unnamed Item, A matheuristic for the firefighter problem on graphs, On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms, Slash and burn on graphs -- firefighting with general weights, The firefighter problem: empirical results on random graphs, The surviving rate of digraphs, A note on the surviving rate of 1-planar graphs, The firefighter problem: further steps in understanding its complexity, The surviving rate of an outerplanar graph for the firefighter problem, The surviving rate of an infected network, The 2-surviving rate of planar graphs without 4-cycles, The surviving rate of planar graphs, The firefighter problem on graph classes, The firefighter problem for cubic graphs, Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion, The firefighter problem with more than one firefighter on trees, A lower bound of the surviving rate of a planar graph with girth at least seven, Surviving rate of graphs and firefighter problem, Firefighting on trees, The firefighter problem for graphs of maximum degree three, Approximability of the firefighter problem. Computing cuts over time, More fires and more fighters, Parameterized complexity of firefighting, Fire containment in grids of dimension three and higher, A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\), Multi-layered planar firefighting, Parameterized Complexity of Firefighting Revisited, The Firefighter Problem: A Structural Analysis, Continuous Firefighting on Infinite Square Grids
