Firefighting on a random geometric graph

DOI10.1002/rsa.20511zbMath1312.05122OpenAlexW2040112760MaRDI QIDQ5252258

Amir Barghi, Peter M. 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

random geometric graphfirefightingorientated percolation

Mathematics Subject Classification ID

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

Related Items (4)

Concentration for Poisson functionals: component counts in random geometric graphs ⋮ Burning number of theta graphs ⋮ Approximation algorithms for the geometric firefighter and budget fence problems ⋮ How to Burn a Graph

Cites Work

• Upper bounds on Poisson tail probabilities
• Percolation
• Random Plane Networks
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item

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