Before revision: The graph burning problem is an NP-Hard optimization problem that models the sequential spread of information over a network. Due to its nature, this problem has been approached through approximation algorithms and heuristics.
After revision: The graph burning problem is an NP-Hard optimization problem that models the sequential spread of information on simple graphs.