A New kth-Shortest Path Algorithm
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 1993-03-25
著者
-
Maruyama Hiroshi
Ibm Research Tokyo Research Laboratory
-
Maruyama Hiroshi
Ibm Research Tokyo Research Laboratory Ibm Japan Ltd.
関連論文
- A New kth-Shortest Path Algorithm
- A Transfer System Using Example-Based Approach (Special Issue on Natural Language Processing and Understanding)