The following pages link to (Q3614015):
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)
- Fighting constrained fires in graphs (Q428868) (← links)
- Firefighting on square, hexagonal, and triangular grids (Q465289) (← links)
- Planar graph is on fire (Q501009) (← links)
- The coarse geometry of Hartnell's firefighter problem on infinite graphs (Q512564) (← links)
- A note on the surviving rate of 1-planar graphs (Q512598) (← 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)
- Burning grids and intervals (Q831694) (← links)
- The firefighter problem on graph classes (Q899308) (← links)
- The firefighter problem for cubic graphs (Q960975) (← links)
- Reconfiguration graphs of shortest paths (Q1660288) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- The firefighter problem with more than one firefighter on trees (Q1949095) (← links)
- Burning graphs: a probabilistic perspective (Q2014226) (← links)
- A lower bound of the surviving rate of a planar graph with girth at least seven (Q2015802) (← links)
- Burning numbers of path forests and spiders (Q2021650) (← links)
- Burning numbers of \(t\)-unicyclic graphs (Q2064928) (← links)
- Iterated local search for the placement of wildland fire suppression resources (Q2079393) (← links)
- Surviving rate of graphs and firefighter problem (Q2141321) (← links)
- Parameterized complexity of immunization in the threshold model (Q2154106) (← links)
- A new model and algorithms in firefighting theory (Q2161254) (← links)
- Burning the plane. Densities of the infinite Cartesian grid (Q2227973) (← links)
- Firefighting on the hexagonal grid (Q2235247) (← links)
- Burning number of theta graphs (Q2279597) (← 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)
- Approximation algorithms for fragmenting a graph against a stochastically-located threat (Q2344215) (← 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)
- Deleting edges to restrict the size of an epidemic in temporal networks (Q2662670) (← links)
- Multi-layered planar firefighting (Q2675861) (← links)
- Coarse geometry of the fire retaining property and group splittings (Q2685703) (← links)
- On efficient vaccine distribution strategy to suppress pandemic using social relation (Q2798324) (← links)
- Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
- New Integrality Gap Results for the Firefighters Problem on Trees (Q2971157) (← links)
- Continuous Firefighting on Infinite Square Grids (Q2988819) (← links)
- Estimation of Distribution Algorithms for the Firefighter Problem (Q3304191) (← links)
- (Q4616090) (← links)
- A survey of graph burning (Q4986283) (← links)
