The surviving rate of an outerplanar graph for the firefighter problem
From MaRDI portal
Publication:627197
DOI10.1016/j.tcs.2010.11.046zbMath1223.05136OpenAlexW2043450552MaRDI QIDQ627197
Xuding Zhu, Xubin Yue, Wei Fan Wang
Publication date: 21 February 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.046
Related Items (13)
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs ⋮ Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ The 2-surviving rate of planar graphs without 6-cycles ⋮ The surviving rate of digraphs ⋮ A note on the surviving rate of 1-planar graphs ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ The surviving rate of an infected network ⋮ The 2-surviving rate of planar graphs without 4-cycles ⋮ The surviving rate of planar graphs ⋮ Firefighting as a Strategic Game
Cites Work
- The surviving rate of an infected network
- Allee effect and control of lake system invasion
- The firefighter problem for cubic graphs
- \(L(h,1)\)-labeling subclasses of planar graphs
- The firefighter problem for graphs of maximum degree three
- The Surviving Rate of a Graph for the Firefighter Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The surviving rate of an outerplanar graph for the firefighter problem