Reversibility properties of the fire-fighting problem in graphs

DOI10.1016/J.COMGEO.2017.10.003zbMath1379.05114OpenAlexW2766073348MaRDI QIDQ1693325

Rolf Klein

Publication date: 12 February 2018

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2017.10.003

zbMATH Keywords

fire-fightinglion-and-man problemoffline search

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (05C99)

Related Items (1)

Geometric firefighting in the half-plane

Cites Work

• Offline variants of the ``lion and man problem: some problems and techniques for measuring crowdedness and for safe path planning
• Escaping offline searchers and isoperimetric theorems
• How many lions are needed to clear a grid?

This page was built for publication: Reversibility properties of the fire-fighting problem in graphs