
doi: 10.1002/net.21873
handle: 11343/285460
AbstractIn the context of the Firefighter problem, a deterministic model of the spread of a fire or virus on a graph, SFIRE is the decision problem that asks if a specified set of vertices can be prevented from burning. We show SFIRE remains NP‐complete even when restricted to graphs with maximum degree 3 even when the fire starts at a vertex of degree 2.
Management decision making, including multiple objectives, discrete-time process, graph theory, firefighter, Programming involving graphs or networks, algorithms, complexity, graph process, 004
Management decision making, including multiple objectives, discrete-time process, graph theory, firefighter, Programming involving graphs or networks, algorithms, complexity, graph process, 004
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
