The firefighter problem for graphs of maximum degree three

被引：79
|
作者：
Finbow, Stephen [1 ]
King, Andrew
MacGillivray, Gary
Rizzi, Romeo
机构：
[1] Univ Victoria, Dept Math & Stat, Victoria, BC, Canada
[2] Univ Trent, Dept Telecommun & Informat, Trento, Italy
来源：
DISCRETE MATHEMATICS | 2007年 / 307卷 / 16期
基金：
加拿大自然科学与工程研究理事会;
关键词：
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.
引用
收藏
页码：2094 / 2105
页数：12
相关论文
共 50 条
  • [21] The Taketa Problem and Character Degree Graphs with Diameter Three
    Mark L. Lewis
    Catherine B. Sass
    Algebras and Representation Theory, 2015, 18 : 1395 - 1399
  • [22] The Taketa Problem and Character Degree Graphs with Diameter Three
    Lewis, Mark L.
    Sass, Catherine B.
    ALGEBRAS AND REPRESENTATION THEORY, 2015, 18 (05) : 1395 - 1399
  • [23] Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
    Zhou, Peiyan
    Jiang, Haitao
    Zhu, Daming
    Zhu, Binhai
    Theoretical Computer Science, 2021, 888 : 22 - 30
  • [24] Approximation algorithms for the maximum vertex coverage problem on bounded degree graphs
    Zhou, Peiyan
    Jiang, Haitao
    Zhu, Daming
    Zhu, Binhai
    THEORETICAL COMPUTER SCIENCE, 2021, 888 : 22 - 30
  • [25] Proof of a Conjecture of Bollobás and Eldridge for Graphs of Maximum Degree Three*
    Béla Csaba†‡
    Ali Shokoufandeh‡
    Endre Szemerédi
    Combinatorica, 2003, 23 : 35 - 72
  • [26] Precoloring extension for 2-connected graphs with maximum degree three
    Voigt, Margit
    DISCRETE MATHEMATICS, 2009, 309 (15) : 4926 - 4930
  • [27] Roman domination and independent Roman domination on graphs with maximum degree three
    Luiz, Atilio G.
    DISCRETE APPLIED MATHEMATICS, 2024, 348 : 260 - 278
  • [28] Local improving algorithms for large cuts in graphs with maximum degree three
    Bylka, S
    DISCRETE MATHEMATICS, 2001, 235 (1-3) : 53 - 67
  • [29] Small independent edge dominating sets in graphs of maximum degree three
    Zwoiniak, GY
    SOFSEM 2006: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2006, 3831 : 556 - 564
  • [30] SURVIVING RATES OF GRAPHS WITH BOUNDED TREEWIDTH FOR THE FIREFIGHTER PROBLEM
    Cai, Leizhen
    Cheng, Yongxi
    Verbin, Elad
    Zhou, Yuan
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2010, 24 (04) : 1322 - 1335
12345