Conference paper
Counterexample to theorems of Cox and Fine
Joseph Y. Halpern
aaai 1996
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
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Aditya Saxena, Shambhavi Shanker, et al.
AGU 2025
Hiroshi Kanayama, Tetsuya Nasukawa
Natural Language Engineering