The Firefighter problem: Saving sets of vertices on cubic graphs
NETWORKS（2019）
摘要
In 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.
更多查看译文
关键词
algorithms,complexity,discrete-time process,Firefighter,graph process,graph theory
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要