Graph-Based Strategies for Optimizing Wildfire Suppression

Abstract

An algorithm for wildfire suppression based on graph theory and that builds on realistic simulations of the propagation, is efficient, produces results in a short period of time and has the potential to help achieving a faster suppression of a real fire is reported.The suppression algorithm looks for the selection of the best locations to attack the suppression of wildfires, is formally correct and its complexity is computed. The performance of the graph-based algorithm is compared to a random and a brute-force approach. The simulations demonstrate that the graph-based algorithm outperforms the other two and that it delivers excellent results.