firefigher problem;
NP-complete problem;
optimization on graphs;
D O I:
10.1016/j.disc.2005.12.053
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We show that the firefighter problem is NP-complete for trees of maximum degree three, but in P for graphs of maximum degree three if the fire breaks out at a vertex of degree at most two. (c) 2006 Elsevier B.V. All rights reserved.