Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310)
From MaRDI portal
scientific article; zbMATH DE number 1935197
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polylog-time and near-linear work approximation scheme for undirected shortest paths |
scientific article; zbMATH DE number 1935197 |
Statements
Polylog-time and near-linear work approximation scheme for undirected shortest paths (English)
0 references
25 June 2003
0 references
polylog-time randomized algorithm
0 references
transitive closure bottleneck
0 references
weighted undirected networks
0 references
near-linear work algorithms
0 references
faster sequential algorithms
0 references
sparse hop sets
0 references
