Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time (Q2944530): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q315535 |
||
| Property / author | |||
| Property / author: Sandeep Sen / rank | |||
Revision as of 20:22, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximate distance oracles for unweighted graphs in expected <i>O</i> ( <i>n</i> <sup>2</sup> ) time |
scientific article |
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
