Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds (Q4458873)
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: Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds |
scientific article; zbMATH DE number 2055948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds |
scientific article; zbMATH DE number 2055948 |
Statements
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds (English)
0 references
14 March 2004
0 references
Bellman-Ford algorithm
0 references
Pallottino's incremental graph algorithm
0 references
threshold approach
0 references
topological ordering SSSP algorithm
0 references
approximate Bucket implementation
0 references
\(\Delta\)-stepping algorithm
0 references
graphs with random edge weights
0 references
0.9159319400787354
0 references
0.9043896198272704
0 references
0.8417655825614929
0 references
