A new model in firefighting theory

DOI10.1007/978-3-030-39219-2_30zbMath1453.68207arXiv1911.10341OpenAlexW3002346630MaRDI QIDQ779236

Jörg-Rüdiger Sack, Barbara Schwarzwald, Elmar Langetepe, David Kübel, Rolf Klein

Publication date: 21 July 2020

Full work available at URL: https://arxiv.org/abs/1911.10341

zbMATH Keywords

computational complexityundecidabilitygraph theoryNP-completenessdiscrete geometrygraph algorithmscellular automatoncombinatorial algorithmsfirefightingfire-behaviour modelingfire-spread modelsforest-fire simulationfrontal propagation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Cellular automata (computational aspects) (68Q80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A new model and algorithms in firefighting theory