(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.
Flicker minimization in power-saving displays enabled by measurement of difference in flexoelectric coefficients and displacement-current in positive dielectric anisotropy liquid crystals
Junho Jung, HaYoung Jung, GyuRi Choi, HanByeol Park, Sun-Mi Park, Ki-Sun Kwon, Heui-Seok Jin, Dong-Jin Lee, Hoon Jeong, JeongKi Park, Byeong Koo Kim, Seung Hee Lee, MinSu Kim
Opto-Electronic Advances
2025-09-25
Dual-frequency angular-multiplexed fringe projection profilometry with deep learning: breaking hardware limits for ultra-high-speed 3D imaging
Wenwu Chen, Yifan Liu, Shijie Feng, Wei Yin, Jiaming Qian, Yixuan Li, Hang Zhang, Maciej Trusiak, Malgorzata Kujawinska, Qian Chen, Chao Zuo
Opto-Electronic Advances
2025-09-25
