All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time |
scientific article |
Statements
All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (English)
0 references
19 February 2009
0 references
shortest path
0 references
distance
0 references
spanner
0 references
