Sebastian Hudert, Torsten Eymann, et al.
IEEE-CEC 2000
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
Conference paper
Risks and potentials of using EMV for internet payments
Els van Herreweghen, Uta Wille
USENIX Workshop on Smartcard Technology 1999
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019