Hits :

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

Date of Publication : 2012-01-01

Document Type : 期刊

Journal : THEORETICAL COMPUTER SCIENCE

Volume: Vol.416

Page Number : 65-70

ISSN : 0304-3975

Translation or Not : no

Key Words : FIREFIGHTER;PROBLEM

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