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

DOI10.1007/S10878-012-9541-4zbMATH Open1291.90288OpenAlexW2042572227MaRDI QIDQ2015802FDOQ2015802

Authors Stephen Finbow, Ping Wang, Weifan 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

girthplanar graphsfirefighter problemsurviving rate

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• The 2-surviving rate of planar graphs without 4-cycles
• The surviving rate of planar graphs
• The edge surviving rate of a class of planar graphs for the firefighter problem
• The 2-surviving rate of planar graphs without 5-cycles
• Planar graph is on fire

Cites Work

• scientific article; zbMATH DE number 1802810 (Why is no real title available?)
• scientific article; zbMATH DE number 2061798 (Why is no real title available?)
• Allee effect and control of lake system invasion
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• Surviving rates of graphs with bounded treewidth for the firefighter problem
• The Firefighter problem: a survey of results, directions and questions
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The surviving rate of a graph for the firefighter problem
• The surviving rate of an infected network
• The surviving rate of planar graphs

Cited In (13)

• The surviving rate of digraphs
• Plane graphs of diameter two are 2-optimal
• Surviving rate of graphs and firefighter problem
• The 2-surviving rate of planar graphs without 5-cycles
• Solving the geometric firefighter routing problem via integer programming
• Planar graphs without chordal 5-cycles are 2-good
• Finding exact solutions for the geometric firefighter problem in practice
• The 2-surviving rate of planar graphs without 4-cycles
• The surviving rate of some oriented planar graphs
• Firefighting as a strategic game
• The firefighter problem: empirical results on random graphs
• The surviving rate of planar graphs without short cycles
• A note on the surviving rate of 1-planar graphs

This page was built for publication: A lower bound of the surviving rate of a planar graph with girth at least seven

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015802)