New Polynomial Shortest Path Algorithms and Their Computational Attributes (Q3750535)
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: New Polynomial Shortest Path Algorithms and Their Computational Attributes |
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
