The surviving rate of planar graphs

DOI10.1016/j.tcs.2011.10.002zbMath1239.05042OpenAlexW2033212080MaRDI QIDQ764317

Jiangxu Kong, Xuding Zhu, Wei Fan Wang

Publication date: 13 March 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.10.002

zbMATH Keywords

planar graphssurviving ratefirefighting

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The 2-surviving rate of planar graphs without 5-cycles ⋮ Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ Structural properties and surviving rate of planar graphs ⋮ The 2-surviving rate of planar graphs without 6-cycles ⋮ The surviving rate of digraphs ⋮ Unnamed Item ⋮ Planar graph is on fire ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ A note on the surviving rate of 1-planar graphs ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ A lower bound of the surviving rate of a planar graph with girth at least seven ⋮ The 2-surviving rate of planar graphs without 4-cycles ⋮ Firefighting as a Strategic Game ⋮ Asymptotic surviving rate of trees with multiple fire sources ⋮ Plane graphs of diameter two are 2-optimal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The surviving rate of an outerplanar graph for the firefighter problem
• The surviving rate of an infected network
• Allee effect and control of lake system invasion
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem