Defines LCR problem on always-connected temporal graphs, gives DP algorithm, proves APX-hardness of shortest reconfiguration, and establishes equivalence to STSR.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Temporal Graph Reconfiguration for Always-Connected Graphs
Defines LCR problem on always-connected temporal graphs, gives DP algorithm, proves APX-hardness of shortest reconfiguration, and establishes equivalence to STSR.
-
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.