Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds (Q4458873)
From MaRDI portal
scientific article; zbMATH DE number 2055948
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
