The Directed Disjoint Shortest Paths Problem (Q5111698): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
The Directed Disjoint Shortest Paths Problem | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7824/pdf/LIPIcs-ESA-2017-13.pdf/ / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2758462134 / rank | |||
Normal rank | |||
| Property / title | |||
The Directed Disjoint Shortest Paths Problem (English) | |||
| Property / title: The Directed Disjoint Shortest Paths Problem (English) / rank | |||
Normal rank | |||
Latest revision as of 10:31, 30 July 2024
scientific article; zbMATH DE number 7204991
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
