Cristina Cornelio, Judy Goldsmith, et al.
JAIR
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
Alex Golts, Daniel Khapun, et al.
MICCAI 2021
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Mustansar Fiaz, Mubashir Noman, et al.
IGARSS 2025