Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Firefighting as a strategic game

Autor
Alvarez, C.; Blesa, M.; Molter, H.
Tipus d'activitat
Article en revista
Revista
Internet Mathematics
Data de publicació
2016-03-31
Volum
12
Número
1-2
Pàgina inicial
101
Pàgina final
120
DOI
https://doi.org/10.1080/15427951.2015.1110542 Obrir en finestra nova
Projecte finançador
Modelos y métodos computacionales para datos masivos estructurados
Repositori
http://hdl.handle.net/2117/99674 Obrir en finestra nova
URL
http://dx.doi.org/10.1080/15427951.2015.1110542 Obrir en finestra nova
Resum
The Firefighter Problem was proposed in 1995 as a deterministic discrete-time model for the spread and containment of a fire. The problem is defined on an undirected finite graph G = (V, E), where fire breaks out initially at f nodes. In each subsequent time-step, two actions occur: a certain number b of firefighters are placed on nonburning nodes, permanently protecting them from the fire, then the fire spreads to all nondefended neighbors of the nodes on fire. Because the graph is finite, at s...
Citació
Álvarez, C., Blesa, M., Molter, H. Firefighting as a strategic game. "Internet mathematics", 31 Març 2016, vol. 12, núm. 1-2, p. 101-120.
Paraules clau
Firefighting Problem, Deterministic Discrete-time Model, Computer Viruses Spread, Topologies
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius