pith. sign in

Title resolution pending

There exists aG′ ⊆Gwith ffn(G ′)≥m

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.CC 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Complexity of Firefighting on Graphs

cs.CC · 2025-05-16 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Complexity of Firefighting on Graphs cs.CC · 2025-05-16 · unverdicted · none · ref 25

    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.