Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
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
Bingzhe Wu, Xiaolu Zhang, et al.
AAAI 2019
Paula Harder, Venkatesh Ramesh, et al.
EGU 2023
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence