Before revision: The graph burning problem is an NP-Hard optimization problem that models the sequential spread of information over a network.
After revision: The graph burning problem is an NP-Hard optimization problem that may be used to model social contagion and the sequential spread of information over a network.