New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures (Q3833887)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures |
scientific article |
Statements
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures (English)
0 references
1989
0 references
partitioning shortest path
0 references
sharpness
0 references
complexity bound
0 references
