A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (Q5134451)
From MaRDI portal
scientific article; zbMATH DE number 7274721
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs |
scientific article; zbMATH DE number 7274721 |
Statements
16 November 2020
0 references
\(k\) shortest path problem
0 references
complexity of algorithms
0 references
ranking of paths
0 references
A new $O(m+k n log overline{d})$ algorithm to find the $k$ shortest paths in acyclic digraphs (English)
0 references
0 references
0 references
