Average firefighting on infinite grids
From MaRDI portal
Publication:3517154
zbMATH Open1178.05068MaRDI QIDQ3517154FDOQ3517154
Authors: Margaret-Ellen Messinger
Publication date: 12 August 2008
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (18)
- Fire containment in grids of dimension three and higher
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
- Surviving rate of graphs and firefighter problem
- Firefighting on trees
- The firefighter problem on orientations of the cubic grid
- On the predictability of the abelian sandpile model
- Firefighting on geometric graphs with density bounds.
- Title not available (Why is that?)
- Orienting edges to fight fire in graphs
- Continuous firefighting on infinite square grids
- Firefighting on the hexagonal grid
- Firefighting as a strategic game
- Firefighting on square, hexagonal, and triangular grids
- Multi-layered planar firefighting
- Burning the plane. Densities of the infinite Cartesian grid
- The firefighter problem for regular infinite directed grids
- Firefighting on the triangular grid
- 3/2 firefighters are not enough
This page was built for publication: Average firefighting on infinite grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3517154)