A new model in firefighting theory

From MaRDI portal
Publication:779236




Abstract: Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied terrains. We present three different firefighting problems in the context of this model; for two of which, we provide efficient polynomial time algorithms and for the third, we show NP-completeness. We also discuss possible extensions of the model and their implications on the computational complexity.









This page was built for publication: A new model in firefighting theory

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