A lower bound of the surviving rate of a planar graph with girth at least seven

DOI10.1007/s10878-012-9541-4zbMath1291.90288OpenAlexW2042572227MaRDI QIDQ2015802

Stephen Finbow, Ping Wang, Wei Fan Wang

Publication date: 24 June 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9541-4

zbMATH Keywords

planar graphsgirthfirefighter problemsurviving rate

Mathematics Subject Classification ID

Dynamic programming (90C39)

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 ⋮ The surviving rate of digraphs ⋮ Unnamed Item ⋮ 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 ⋮ The 2-surviving rate of planar graphs without 4-cycles ⋮ Firefighting as a Strategic Game ⋮ Plane graphs of diameter two are 2-optimal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The surviving rate of an infected network
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• The surviving rate of planar graphs
• 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