Deciding ffn(G) <= m is NP-hard, shortest strategies on complete binary trees have superpolynomial length, with almost sharp bounds for those trees and transfer of results to the Hunter and Rabbit game.
The minimal regular graph containing a given graph.Ameri- can Mathematical Monthly, 70:1074
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complexity of Firefighting on Graphs
Deciding ffn(G) <= m is NP-hard, shortest strategies on complete binary trees have superpolynomial length, with almost sharp bounds for those trees and transfer of results to the Hunter and Rabbit game.