Hits :

First Author : Weifan Wang

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

Date of Publication : 2011-01-01

Document Type : 期刊

Journal : Theoretical Computer Science

Volume: Vol.412

Issue : No.8-10

Page Number : 913-921

ISSN : 0304-3975

Translation or Not : no

Key Words : Firefighter;problem;Surviving;rate;Outerplanar;graph

Abstract : Let G be a connected graph with n ≥ 2 vertices. Let k ≥ 1 be an integer. 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 k-vertices not yet on fire. At the end of