Pages that link to "Item:Q2370449"

The following pages link to The firefighter problem for graphs of maximum degree three (Q2370449):

Displaying 50 items.

• The 2-surviving rate of planar graphs without 5-cycles (Q281784) (← links)
• Slash and burn on graphs -- firefighting with general weights (Q299037) (← links)
• The firefighter problem: empirical results on random graphs (Q337557) (← links)
• The 2-surviving rate of planar graphs without 6-cycles (Q391779) (← links)
• The surviving rate of digraphs (Q396728) (← links)
• Firefighting on square, hexagonal, and triangular grids (Q465289) (← links)
• A note on the surviving rate of 1-planar graphs (Q512598) (← links)
• The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
• The surviving rate of an outerplanar graph for the firefighter problem (Q627197) (← links)
• The surviving rate of an infected network (Q708218) (← links)
• The 2-surviving rate of planar graphs without 4-cycles (Q714853) (← links)
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly (Q742585) (← links)
• The surviving rate of planar graphs (Q764317) (← links)
• The firefighter problem on graph classes (Q899308) (← links)
• The firefighter problem for cubic graphs (Q960975) (← links)
• Galaxy cutsets in graphs (Q975761) (← links)
• Finding exact solutions for the geometric firefighter problem in practice (Q1652708) (← links)
• Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
• Solving the geometric firefighter routing problem via integer programming (Q1755409) (← links)
• The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
• A lower bound of the surviving rate of a planar graph with girth at least seven (Q2015802) (← links)
• On perturbation resilience of non-uniform \(k\)-center (Q2072096) (← links)
• Complexity of the multilevel critical node problem (Q2121476) (← links)
• Surviving rate of graphs and firefighter problem (Q2141321) (← links)
• Asymptotic quasi-polynomial time approximation scheme for resource minimization for fire containment (Q2165027) (← links)
• Firefighting on trees (Q2328866) (← links)
• Approximation algorithms for the geometric firefighter and budget fence problems (Q2331446) (← links)
• Asymptotic surviving rate of trees with multiple fire sources (Q2341747) (← links)
• Burning a graph is hard (Q2410223) (← links)
• Approximability of the firefighter problem. Computing cuts over time (Q2428668) (← links)
• More fires and more fighters (Q2444533) (← links)
• Parameterized complexity of firefighting (Q2453548) (← links)
• A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\) (Q2476259) (← links)
• Multi-layered planar firefighting (Q2675861) (← links)
• TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING (Q2841981) (← links)
• Defending Planar Graphs against Star-Cutsets (Q2851448) (← links)
• Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
• The Firefighter Problem: A Structural Analysis (Q2946017) (← links)
• Continuous Firefighting on Infinite Square Grids (Q2988819) (← links)
• (Q4616090) (← links)
• Fire Containment in Planar Graphs (Q5325939) (← links)
• On a Fire Fighter’s Problem (Q5384460) (← links)
• How to Burn a Graph (Q5856432) (← links)
• Firefighting as a Strategic Game (Q5856433) (← links)
• Geometric firefighting in the half-plane (Q5918101) (← links)
• Robust \(k\)-center with two types of radii (Q5918429) (← links)
• On structural parameterizations of firefighting (Q5920210) (← links)
• Robust \(k\)-center with two types of radii (Q5925649) (← links)
• (Q6062155) (← links)
• A matheuristic for the firefighter problem on graphs (Q6067888) (← links)