Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 21:40, 5 March 2024
scientific article; zbMATH DE number 6326986
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
