Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs - Archive ouverte HAL Access content directly
Journal Articles ACM Journal of Experimental Algorithmics Year : 2009

Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs

Clémence Magnien
Matthieu Latapy
Michel Habib

Abstract

The diameter of a graph is among its most basic parameters. Since a few years ago, it moreover became a key issue to compute it for massive graphs in the context of complex network analysis. However, known algorithms, including the ones producing approximate values, have too high a time and/or space complexity to be used in such cases. We propose here a new approach relying on very simple and fast algorithms that compute (upper and lower) bounds for the diameter. We show empirically that, on various real-world cases representative of complex networks studied in the literature, the obtained bounds are very tight (and even equal in some cases). This leads to rigorous and very accurate estimations of the actual diameter in cases which were previously untractable in practice.

Dates and versions

hal-01146069 , version 1 (27-04-2015)

Identifiers

Cite

Clémence Magnien, Matthieu Latapy, Michel Habib. Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. ACM Journal of Experimental Algorithmics, 2009, 13, pp.10. ⟨10.1145/1412228.1455266⟩. ⟨hal-01146069⟩
53 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More