Weiming Hu, Nianhua Xie, et al.
IEEE TPAMI
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
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Arthur Nádas
IEEE Transactions on Neural Networks
Mustansar Fiaz, Mubashir Noman, et al.
IGARSS 2025