New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches (Q2999348)
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 bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches |
scientific article; zbMATH DE number 5887553
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches |
scientific article; zbMATH DE number 5887553 |
Statements
New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches (English)
0 references
12 May 2011
0 references
0.9159319400787354
0 references
0.8229101300239563
0 references
0.7809743285179138
0 references
0.7783032059669495
0 references
0.7711748480796814
0 references
