5 citations · 8 across the 3 of their papers we have counts for
1 paper · 1 filter
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…