Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822)
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: Fast approximation algorithms for the diameter and radius of sparse graphs |
scientific article; zbMATH DE number 6326986
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast approximation algorithms for the diameter and radius of sparse graphs |
scientific article; zbMATH DE number 6326986 |
Statements
Fast approximation algorithms for the diameter and radius of sparse graphs (English)
0 references
7 August 2014
0 references
approximation algorithm
0 references
graph diameter
0 references
shortest paths
0 references
0.9213231205940248
0 references
0.8842805624008179
0 references
0.8842805624008179
0 references
0.8821215033531189
0 references
0.8818596601486206
0 references
