Firefighting on a random geometric graph

DOI10.1002/RSA.20511MaRDI QIDQ5252258zbMATH OpenOpenAlexFDO

Authors Amir Barghi, Peter Winkler

Publication date 29 May 2015

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20511

zbMATH Keywords

firefightingorientated percolationrandom geometric graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Firefighting on geometric graphs with density bounds.
• Multi-layered planar firefighting
• Fighting constrained fires in graphs
• Firefighting on square, hexagonal, and triangular grids
• Sparse graphs are not flammable

Cites work

• scientific article; zbMATH DE number 1802810 (Why is no real title available?)
• Percolation
• Probability Inequalities for Sums of Bounded Random Variables
• Random Plane Networks
• The Firefighter problem: a survey of results, directions and questions
• Upper bounds on Poisson tail probabilities

Cited in

(10)

• Burning number of theta graphs
• Approximation algorithms for the geometric firefighter and budget fence problems
• Concentration for Poisson functionals: component counts in random geometric graphs
• The spread of fire on a random multigraph
• Firefighting on trees and Cayley graphs
• Fire Containment in Planar Graphs
• Firefighting on geometric graphs with density bounds.
• How to Burn a Graph
• Burning Numbers of Barbells
• The burning game on graphs

This page was built for publication: Firefighting on a random geometric graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5252258)