scientific article; zbMATH DE number 1506515
From MaRDI portal
Publication:4504908
Recommendations
Cited in
(22)- Plane graphs of diameter two are 2-optimal
- Surviving rate of graphs and firefighter problem
- The firefighter problem for graphs of maximum degree three
- Parameterized complexity of firefighting
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
- Parameterized Complexity of Firefighting Revisited
- scientific article; zbMATH DE number 1802810 (Why is no real title available?)
- scientific article; zbMATH DE number 3878668 (Why is no real title available?)
- The firefighter problem: empirical results on random graphs
- Methods for removing links in a network to minimize the spread of infections
- Seepage in directed acyclic graphs
- Firefighting on square, hexagonal, and triangular grids
- On designing a network to defend against random attacks of radius two
- The coarse geometry of Hartnell's firefighter problem on infinite graphs
- Minimizing the Maximum Firewall Rule Set in a Network with Multiple Firewalls
- Firefighting as a strategic game
- Distance-restricted firefighting on finite graphs
- The surviving rate of an infected network
- The 2-surviving rate of planar graphs without 4-cycles
- Advancing firefighter games: novel integer programming formulations and the cost-value model
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- The firefighter problem for cubic graphs
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 Q4504908)