Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time (Q2944530)
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: Approximate distance oracles for unweighted graphs in expected O(n^2) time |
scientific article; zbMATH DE number 6477860
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate distance oracles for unweighted graphs in expected \(O(n^2)\) time |
scientific article; zbMATH DE number 6477860 |
Statements
Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (English)
0 references
2 September 2015
0 references
approximate distance oracles
0 references
distance queries
0 references
distances
0 references
shortest paths
0 references
spanners
0 references
0.8934573531150818
0 references
0.886633574962616
0 references
0.8841872811317444
0 references
0.8807298541069031
0 references
