31 citations · 59 across the 7 of their papers we have counts for
1 paper · 2 filters
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…