Deciding existence of a temporally connected subgraph on at least 3 vertices is NP-hard for directed/undirected and strict/non-strict temporal graphs via simple and proper reductions.
▷ Claim D.17.Let i∈[8,k−8]with imod 6 = 2, such thatS containsv∗ i−2andv∗ i
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Hardness of Finding Temporally Connected Subgraphs of Any Size
Deciding existence of a temporally connected subgraph on at least 3 vertices is NP-hard for directed/undirected and strict/non-strict temporal graphs via simple and proper reductions.