The next‐to‐shortest path problem on directed graphs with positive edge weights (Q4642453)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6871453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The next‐to‐shortest path problem on directed graphs with positive edge weights |
scientific article; zbMATH DE number 6871453 |
Statements
The next‐to‐shortest path problem on directed graphs with positive edge weights (English)
0 references
23 May 2018
0 references
algorithm
0 references
time complexity
0 references
planar graph
0 references
digraph
0 references
directed acyclic graph
0 references
\(k\) shortest paths
0 references
next-to-shortest path
0 references
0.9143336
0 references
0.9090093
0 references
0.8819444
0 references
0.8769256
0 references
0.8759991
0 references
0.87343144
0 references
0.8731333
0 references
