Hits :

First Author : Weifan Wang

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

Date of Publication : 2014-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.27

Issue : No.4

Page Number : 621-642

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Firefighter;problem;Surviving;rate;Planar;graphs;Girth

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 one vertex not yet on fire. At the end of each time interval, the fi