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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Frontiers of Mathematics Ročník 17; číslo 2; s. 227 - 254
Hlavní autoři: Wang, Weifan, Kong Jiangxu
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Nature B.V 01.04.2022
Témata:
Algorithms
Apexes
Burning rate
Computer viruses
Firefighters
Graph theory
Graphs
ISSN:2731-8648, 2731-8656
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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