Faster Approximation of Distances in Graphs (Q3603556): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_47 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1530560842 / rank | |||
Normal rank | |||
Latest revision as of 20:15, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster Approximation of Distances in Graphs |
scientific article |
Statements
Faster Approximation of Distances in Graphs (English)
0 references
17 February 2009
0 references
weighted undirected graph
0 references
shortest path metric
0 references
deterministic algorithm
0 references
Boolean matrix multiplication
0 references
radius of a graph
0 references
diameter of a graph
0 references
