Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1935197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9859115
0 references
0.90141827
0 references
0 references
0.8908569
0 references
0.8871861
0 references
0.8834129
0 references
0.87989175
0 references
0.8795755
0 references
0.87570417
0 references
