The surviving rate of digraphs

DOI10.1016/J.DISC.2014.06.018zbMath1297.05099OpenAlexW2053514817MaRDI QIDQ396728

Jiangxu Kong, Wei Fan Wang, Lian Zhu Zhang

Publication date: 14 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.018

zbMATH Keywords

digraphplanar graphfirefighter problemsurviving ratedischarging

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Surviving rate of graphs and firefighter problem ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ Unnamed Item ⋮ Estimation of Distribution Algorithms for the Firefighter Problem ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ Unnamed Item

Cites Work

• The 2-surviving rate of planar graphs without 6-cycles
• The surviving rate of an outerplanar graph for the firefighter problem
• The surviving rate of an infected network
• The 2-surviving rate of planar graphs without 4-cycles
• The surviving rate of planar graphs
• The firefighter problem for cubic graphs
• A lower bound of the surviving rate of a planar graph with girth at least seven
• The firefighter problem for graphs of maximum degree three
• Structural properties and surviving rate of planar graphs
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• Fire Containment in Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The surviving rate of digraphs