A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Burning a graph is hard
2017
Discrete Applied Mathematics
We introduce a new graph parameter called the burning number, inspired by contact processes on graphs such as graph bootstrap percolation, and graph searching paradigms such as Firefighter. The burning number measures the speed of the spread of contagion in a graph; the lower the burning number, the faster the contagion spreads. We provide algorithmic results on the burning number, and prove the corresponding graph decision problem is NP-complete even when restricted to graph classes such as
doi:10.1016/j.dam.2017.07.016
fatcat:n5hpmiwmd5dxlhcqozii2gmo4m