31 citations · 59 across the 7 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2013
The Firefighter Problem: A Structural Analysis
Janka Chlebíková, Morgan Chopin
We consider the complexity of the firefighter problem where b>=1 firefighters are available at each time step. This problem is proved NP-complete even on trees of degree at most th…
cs.DM2011
The firefighter problem with more than one firefighter on trees
Cristina Bazgan, Morgan Chopin, Bernard Ries
In this paper we study the complexity of the firefighter problem and related problems on trees when more than one firefighter is available at each time step, and answer several ope…