On computing the Gromov hyperbolicity - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Journal of Experimental Algorithmics Year : 2015

On computing the Gromov hyperbolicity


The Gromov hyperbolicity is an important parameter for analyzing complex networks which expresses how the metric structure of a network looks like a tree. It is for instance used to provide bounds on the expected stretch of greedy-routing algorithms in Internet-like graphs. However, the best known theoretical algorithm computing this parameter runs in O(n^3.69) time, which is prohibitive for large-scale graphs. In this paper, we propose an algorithm for determining the hyperbolicity of graphs with tens of thousands of nodes. Its running time depends on the distribution of distances and on the actual value of the hyperbolicity. Although its worst case runtime is O(n^4), it is in practice much faster than previous proposals as observed in our experimentations. Finally, we propose a heuristic algorithm that can be used on graphs with millions of nodes. Our algorithms are all evaluated on benchmark instances.
Fichier principal
Vignette du fichier
CCL15-no-format.pdf (745.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01182890 , version 1 (05-08-2015)



Nathann Cohen, David Coudert, Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal of Experimental Algorithmics, 2015, 20 (1), pp.18. ⟨10.1145/2780652⟩. ⟨hal-01182890⟩
704 View
535 Download



Gmail Facebook X LinkedIn More