Michael Factor, Dafna Sheinwald
Information Sciences
Paper
New kth-shortest path algorithm
Abstract
This paper presents a new algorithm for finding the kth- shortest paths between a specified pair of vertices in a directed graph with arcs having non-negative costs.
Related
Junchen Jiang, Yue Zhu
OSSNA 2025
Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019
Arnold.L. Rosenberg
Journal of the ACM