Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing
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
Vinayak Gupta, Rajmohan C, et al.
ICON 2022
Anurag Ajay, Seungwook Han, et al.
NeurIPS 2023
Berrin Yanikoglu, Peter A. Sandon
Pattern Recognition