The Directed Disjoint Shortest Paths Problem (Q5111698)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Directed Disjoint Shortest Paths Problem |
scientific article; zbMATH DE number 7204991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Directed Disjoint Shortest Paths Problem |
scientific article; zbMATH DE number 7204991 |
Statements
27 May 2020
0 references
disjoint paths
0 references
shortest path
0 references
polynomial-time algorithm
0 references
The Directed Disjoint Shortest Paths Problem (English)
0 references
0 references
0.9519199
0 references
0 references
0.91032404
0 references
0.9047006
0 references
0.89636946
0 references
0.89636946
0 references
0 references
0 references
