(Peer-Reviewed) Surviving rate of graphs and Firefighter Problem
Weifan WANG 王维凡, Jiangxu KONG 孔将旭
Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China
中国 金华 浙江师范大学数学系
Abstract
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 fire-fighter 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, Fire-fighter 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.
Triplet exciton harvesting via TADF in hafnium chlorides array scintillator screen enables ultrahigh-resolution X-ray imaging
Jun'an Lai, Yi Ye, Xu Liu, Sijun Cao, Shiji Zhou, Wenxia Zhang, Kang An, Peng He, Tingming Jiang, Xiaosheng Tang, Rui Zhou, Dong Zhang
Opto-Electronic Advances
2026-06-08
Vacancy oscillating mode in amorphous binary oxide film by terahertz time domain spectroscopy
Huan Liu, Haiyun Huang, Heng Yu, Zhi Gong, Fei Yu, Zheng Zhang, Zhiyong Tan, Juncheng Cao, Haiyun Liu, Kan-Hao Xue, Xiangshui Miao, Yan Liu, Yue Hao, Genquan Han, Qihua Xiong
Opto-Electronic Advances
2026-06-08
