Faster Approximation of Distances in Graphs (Q3603556)
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: Faster Approximation of Distances in Graphs |
scientific article; zbMATH DE number 5508829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster Approximation of Distances in Graphs |
scientific article; zbMATH DE number 5508829 |
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
0.8801665306091309
0 references
0.8801665306091309
0 references
0.8744174838066101
0 references
0.8497375845909119
0 references
