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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The surviving rate of an infected network
• The surviving rate of planar graphs
• The firefighter problem for cubic graphs
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• Allee effect and control of lake system invasion

Cited In (12)

• The surviving rate of digraphs
• Plane graphs of diameter two are 2-optimal
• Surviving rate of graphs and firefighter problem
• Firefighting as a Strategic Game
• 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
• Title not available (Why is that?)
• The firefighter problem: empirical results on random graphs
• 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)