Vinayak Gupta, Rajmohan C, et al.
ICON 2022
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
Kazuaki Ishizaki, Takeshi Ogasawara, et al.
VEE 2012
Paper
Magic functions
Cynthia Dwork, Moni Naor, et al.
Journal of the ACM
Rakesh Mohan, Ramakant Nevatia
IEEE Transactions on Pattern Analysis and Machine Intelligence