scientific article
From MaRDI portal
Publication:3147255
zbMath1019.05035MaRDI QIDQ3147255
Stephanie A. Moeller, Ping Wang
Publication date: 18 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The firefighter problem for graphs of maximum degree three ⋮ The firefighter problem: empirical results on random graphs ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ A new model and algorithms in firefighting theory ⋮ Multi-layered planar firefighting ⋮ Logic-based Benders decomposition for wildfire suppression ⋮ The surviving rate of an outerplanar graph for the firefighter problem ⋮ Approximability of the firefighter problem. Computing cuts over time ⋮ New Integrality Gap Results for the Firefighters Problem on Trees ⋮ Firefighting on square, hexagonal, and triangular grids ⋮ On a Fire Fighter’s Problem ⋮ Continuous Firefighting on Infinite Square Grids ⋮ Fire containment in grids of dimension three and higher ⋮ The coarse geometry of Hartnell's firefighter problem on infinite graphs ⋮ A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\) ⋮ The firefighter problem for cubic graphs ⋮ The surviving rate of an infected network ⋮ A lower bound of the surviving rate of a planar graph with girth at least seven ⋮ Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion ⋮ The surviving rate of planar graphs ⋮ Firefighting on trees ⋮ Firefighting on a random geometric graph ⋮ Firefighting as a Strategic Game
