Maximizing vertex rescue: investigating the firefighter problem with edge subdivision
The firefighter problem is a game played on a connected graph where a fire breaks out at a vertex. In each round, a firefighter chooses a vertex to protect, and the fire then spreads to all unprotected neighbors of the burning vertex. This sequence continues until the fire can no longer spread. The...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-01-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2418643 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|