P.C. Yue, C.K. Wong
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
Tushar Deepak Chandra, Sam Toueg
Journal of the ACM
Arnold L. Rosenberg
Journal of the ACM
Pranjal Awasthi, Vitaly Feldman, et al.
JMLR