Surviving rate of graphs and Firefighter Problem

The Firefighter Problem on a graph can be viewed as a simplified model of the spread of contagion, fire, rumor, computer virus, etc. The fire breaks out at one or more vertices in a graph at the first round, and the firefighter chooses some vertices to protect. The fire spreads to all non-protected...

Full description

Saved in:
Bibliographic Details
Published in:Frontiers of Mathematics Vol. 17; no. 2; pp. 227 - 254
Main Authors: Wang, Weifan, Kong Jiangxu
Format: Journal Article
Language:English
Published: Dordrecht Springer Nature B.V 01.04.2022
Subjects:
Algorithms
Apexes
Burning rate
Computer viruses
Firefighters
Graph theory
Graphs
ISSN:2731-8648, 2731-8656
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Firefighter Problem on a graph can be viewed as a simplified model of the spread of contagion, fire, rumor, computer virus, etc. The fire breaks out at one or more vertices in a graph at the first round, and the firefighter chooses some vertices to protect. The fire spreads to all non-protected neighbors at the beginning of each time-step. The process stops when the fire can no longer spread. The Firefighter Problem has attracted considerable attention since it was introduced in 1995. In this paper we provide a survey on recent research progress of this field, including algorithms and complexity, Firefighter Problem for special graphs (finite and infinite) and digraphs, surviving rate and burning number of graphs. We also collect some open problems and possible research subjects.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2731-8648
2731-8656
DOI:10.1007/s11464-022-1009-y