Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
Count ing temporal paths
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
-
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.