scientific article; zbMATH DE number 2061798

MaRDI QIDQ4457546zbMATH OpenFDO

Authors Gary MacGillivray, Ping Wang

Publication date 25 March 2004

zbMATH Keywords

algorithmstreesboundssquare grids

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)

Recommendations

• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The firefighter problem on graph classes
• The Firefighter problem: a survey of results, directions and questions
• The Firefighter Problem: A Structural Analysis

Cited in

(34)

• The firefighter problem for graphs of maximum degree three
• A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
• Surviving rate of graphs and firefighter problem
• Firefighting on trees
• The firebreak problem
• The firefighter problem for cubic graphs
• The surviving rate of NIC-planar graphs
• The firefighter problem: saving sets of vertices on cubic graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• The firefighter problem with more than one firefighter on trees
• A matheuristic for the firefighter problem on graphs
• The surviving rate of an infected network
• The surviving rate of digraphs
• The 2-surviving rate of planar graphs without 4-cycles
• Parameterized complexity of firefighting
• The firefighter problem on graph classes
• Continuous firefighting on infinite square grids
• The surviving rate of an outerplanar graph for the firefighter problem
• The Firefighter Problem: A Structural Analysis
• An analysis of the weighted firefighter problem
• More fires and more fighters
• The Firefighter problem: a survey of results, directions and questions
• Approximability of the firefighter problem. Computing cuts over time
• Parameterized Complexity of Firefighting Revisited
• The surviving rate of planar graphs
• Firefighting as a strategic game
• On the firefighter problem with spreading vaccination for maximizing the number of saved nodes: the IP model and LP rounding algorithms
• The firefighter problem: further steps in understanding its complexity
• Multi-layered planar firefighting
• The firefighter problem: empirical results on random graphs
• A note on the surviving rate of 1-planar graphs
• A lower bound of the surviving rate of a planar graph with girth at least seven
• Fire containment in grids of dimension three and higher
• Slash and burn on graphs -- firefighting with general weights

This page was built for publication:

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