Finding the diameter in real-world graphs. Experimentally turning a lower bound into an upper bound

DOI10.1007/978-3-642-15775-2_26zbMATH Open1287.05140OpenAlexW1565438868MaRDI QIDQ3586472FDOQ3586472

Authors: Pilu Crescenzi, Roberto Grossi, Claudio Imbrenda, Leonardo Lanzi, Andrea Marino 

Publication date: 6 September 2010

Published in: Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_26

Recommendations

• On computing the diameter of real-world undirected graphs
• Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs
• Fast computation of empirically tight bounds for the diameter of massive graphs
• Computing giant graph diameters
• Fast approximation algorithms for the diameter and radius of sparse graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)

Cited In (2)

• Fast computation of empirically tight bounds for the diameter of massive graphs
• On computing the diameter of real-world undirected graphs

This page was built for publication: Finding the diameter in real-world graphs. Experimentally turning a lower bound into an upper bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586472)