Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2488608.2488673 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2047489708 / rank | |||
Normal rank | |||
Latest revision as of 21:04, 19 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
