A new O(m + kn log d) algorithm to Find the k shortest paths in acyclic digraphs
We give an algorithm, called T*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.First the nodes of the graph are labeled according to the topologicalordering. Then for node i an ordered list of simple s − i paths iscreated. The length of the...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2016-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | http://www.combinatorics.ir/article_12602_8c4b300132a9c7b4f66cb1e49e80f1c2.pdf |