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.
Data Science and Engineering , volume =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
extension 1
citation-polarity summary
fields
cs.DS 2verdicts
UNVERDICTED 2roles
extension 1polarities
extend 1representative citing papers
Introduces temporal beer paths with time-dependent vertices and matching-complexity algorithms for four path variants plus dynamic preprocessing.
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.
-
Beer Path Problems in Temporal Graphs
Introduces temporal beer paths with time-dependent vertices and matching-complexity algorithms for four path variants plus dynamic preprocessing.