Hits :

First Author : Weifan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : Theoretical Computer Science

Volume: Vol.457

Page Number : 158-165

ISSN : 0304-3975

Translation or Not : no

Key Words : Firefighter;problem;2-surviving;rate;Planar;graph;Cycle

Abstract : Let G be a connected graph with n >= 2 vertices. Suppose that a fire breaks out at a vertex v of G. A firefighter starts to protect vertices. At each time interval, the firefighter protects two vertices not yet on fire. At the end of each time interval, t