New Polynomial Shortest Path Algorithms and Their Computational Attributes (Q3750535): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Darwin D. Klingman / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Nancy V. Phillips / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Robert F. Schneider / rank | |||
Normal rank | |||
Revision as of 21:08, 20 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New Polynomial Shortest Path Algorithms and Their Computational Attributes |
scientific article |
Statements
New Polynomial Shortest Path Algorithms and Their Computational Attributes (English)
0 references
1985
0 references
polynomially bounded partitioning shortest path
0 references
computational testing
0 references
sharp variants
0 references
near-sharp variants
0 references
