Jayadeva, Sameena Shah, et al.
Swarm Intelligence
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
Tim Erdmann, Stefan Zecevic, et al.
ACS Spring 2024
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Guojing Cong, David A. Bader
Journal of Parallel and Distributed Computing