Deciding TC spanning tree existence in temporal graphs is NP-complete; bidirectional spanners are testable in P but their minimization is NP-hard, with FPT algorithms via feedback edge set parameterization.
Enumeration of sd separators in dags with application to reliability analysis in temporal g raphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
In search of the lost tree: Hardness and relaxation of spanning trees in temporal graphs
Deciding TC spanning tree existence in temporal graphs is NP-complete; bidirectional spanners are testable in P but their minimization is NP-hard, with FPT algorithms via feedback edge set parameterization.