On Short Fastest Paths in Temporal Graphs.

Temporal graphs equip their directed edges with a departure time and a duration, which allows to model a surprisingly high number of real-world problems. Recently, Wu et al. have shown that a fastest path in a temporal graph G from a given vertex s to a vertex z can be computed in near-linear time, where a fastest path is one that minimizes the arrival time at z minus the departure time at s.