Firefighting as a Strategic Game
DOI10.1080/15427951.2015.1110542zbMath1461.05191OpenAlexW2316777776MaRDI QIDQ5856433
Carme Àlvarez, Hendrik Molter, Maria J. Blesa
Publication date: 26 March 2021
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15427951.2015.1110542
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Noncooperative games (91A10) Network design and communication in computer systems (68M10) Games involving graphs (91A43) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fighting constrained fires in graphs
- Firefighting on square, hexagonal, and triangular grids
- The surviving rate of an outerplanar graph for the firefighter problem
- The surviving rate of an infected network
- The 2-surviving rate of planar graphs without 4-cycles
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- A comment on pure-strategy Nash equilibria in competitive diffusion games
- The surviving rate of planar graphs
- The firefighter problem for cubic graphs
- A note on competitive diffusion through social networks
- Geometric algorithms and combinatorial optimization
- 3/2 firefighters are not enough
- Nash equilibria for competitive information diffusion on trees
- The firefighter problem with more than one firefighter on trees
- A lower bound of the surviving rate of a planar graph with girth at least seven
- The firefighter problem for graphs of maximum degree three
- Approximability of the firefighter problem. Computing cuts over time
- More fires and more fighters
- Information diffusion on the iterated local transitivity model of online social networks
- Parameterized complexity of firefighting
- Fire containment in grids of dimension three and higher
- A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\)
- TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING
- Parameterized Complexity of Firefighting Revisited
- Burning a Graph as a Model of Social Contagion
- The Firefighter Problem: A Structural Analysis
- Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
- The Surviving Rate of a Graph for the Firefighter Problem
- Firefighting on Trees: (1 − 1/e)–Approximation, Fixed Parameter Tractability and a Subexponential Algorithm
- The Competitive Diffusion Game in Classes of Graphs
- Fire Containment in Planar Graphs
