Title of article
The firefighter problem for graphs of maximum degree three Original Research Article
Author/Authors
Stephen Finbow، نويسنده , , Andrew King، نويسنده , , Gary MacGillivray، نويسنده , , Romeo Rizzi، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
12
From page
2094
To page
2105
Abstract
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.
Keywords
Firefigher problem , Optimization on graphs , NP-complete problem
Journal title
Discrete Mathematics
Serial Year
2007
Journal title
Discrete Mathematics
Record number
947583
Link To Document