Fast and Simple Approximation of the Diameter and Radius of a Graph

DOI10.1007/11764298_9zbMath1196.68320OpenAlexW1598532264MaRDI QIDQ5307536

Karlis Freivalds, Pēteris Lediņš, Rūdolfs Opmanis, Krists Boitmanis

Publication date: 14 September 2007

Published in: Experimental Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11764298_9

zbMATH Keywords

analysis of algorithmsgraph algorithmsgraph diameteralgorithm engineeringapproximation techniques

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (3)

On Trade-Offs in External-Memory Diameter-Approximation ⋮ Fast approximation of betweenness centrality through sampling ⋮ Computing Giant Graph Diameters

This page was built for publication: Fast and Simple Approximation of the Diameter and Radius of a Graph