Accelerating Minimum Temporal Paths Query Based On Dynamic Programming

Temporal path is a fundamental problem in the research of temporal graphs. The solutions [19] in existing studies are not efficient enough since they spend more time to scan temporal edges which reflects connections between two vertices in every time instants. Therefore, in this paper, we first propose efficient algorithms including FDP and SDP, using dynamic programming to calculate the shortest path and fastest path respectively. Then we define a restricted minimum temporal path for some special requirements, including the restricted earliest-arrival path and restricted latest-departure path, and present REDP and RLDP algorithms to solve them. Finally, extensive experiments have demonstrated that our proposed algorithms are effective and efficient over massive real-world temporal graphs.