Arthur Nádas
IEEE Transactions on Neural Networks
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
Wooseok Choi, Tommaso Stecconi, et al.
Advanced Science
Hong-linh Truong, Maja Vukovic, et al.
ICDH 2024
Cristina Cornelio, Judy Goldsmith, et al.
JAIR