journal article
oaidoi:10.1016/j.disc.2005.12.053

The firefighter problem for graphs of maximum degree three

Authors
Publication date
28 July 2007
Publisher
Elsevier B.V.
Doi

    Abstract

    AbstractWe 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

    Similar works

    Full text

    thumbnail-image

    Elsevier - Publisher Connector

    redirect
    oaidoi:10.1016/j.disc.2005.12.053
    Last time updated on 05/05/2017

    This paper was published in Elsevier - Publisher Connector .

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.