Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
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.
Masami Akamine, Jitendra Ajmera
IEICE Trans Inf Syst
Joseph Y. Halpern, Yoram Moses
Journal of the ACM
David W. Jacobs, Daphna Weinshall, et al.
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pol G. Recasens, Yue Zhu, et al.
EuroSys 2024