(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.
Ultrafast all-optical biomimetic encoder for spiking neural networks
Qijun Bian, Fangchen Hu, Junlian Jia, Aolong Sun, Sizhe Xing, Boyu Dong, An Yan, Ziwei Li, Jianyang Shi, Nan Chi, Junwen Zhang
Opto-Electronic Science
2026-10-20
Neural holography enabled multi-beam steering for multi-task classifier
Lin Wu, Mian Wu, Zhen Li, Ying Qiu, Zichen Liu, Yongquan Zeng, Guozhen Liang, Hanbing Li, Guoxing Zheng, Zhixue He, Xi Xiao, Qi Jie Wang, Jin Tao, Shaohua Yu
Opto-Electronic Technology
2026-09-30
Recent progress on mid-infrared and terahertz dual-comb spectroscopy
Zhuoren Wan, Min Li, Binbin Liu, Yu Xia, Yuan Chen, Xiuxiu Zhang, Dongxu Zhu, Yan Dai, Sinan Tao, Hua Li, Ming Yan, Heping Zeng
Opto-Electronic Technology
2026-09-30