Defines TEDSC with a poly-time algorithm plus FPT and hardness results for distance- and time-bounded variants on static networks.
Directed temporal tree realization for periodic public transport: Easy and hard cases
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Temporal Routing in Static Networks: The Schedule Completion Problem
Defines TEDSC with a poly-time algorithm plus FPT and hardness results for distance- and time-bounded variants on static networks.