Dzung Phan, Vinicius Lima
INFORMS 2023
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
Arthur Nádas
IEEE Transactions on Neural Networks
Kaiyuan Zhang, Guanhong Tao, et al.
ICLR 2023
Merve Unuvar, Yurdaer Doganata, et al.
CLOUD 2014