Skip to Main content Skip to Navigation
New interface
Conference papers

Hyperbolicity Computation through Dominating Sets

David Coudert 1 André Nusser 2 Laurent Viennot 3, 4 
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Hyperbolicity is a graph parameter related to how much a graph resembles a tree with respect to distances. Its computation is challenging as the main approaches consist in scanning all quadruples of the graph or using fast matrix multiplication as building block, both are not practical for large graphs. In this paper, we propose and evaluate an approach that uses a hierarchy of distance-k dominating sets to reduce the search space. This technique, compared to the previous best practical algorithms, enables us to compute the hyperbolicity of graphs with unprecedented size (up to a million nodes) and speeds up the computation of previously attainable graphs by up to 3 orders of magnitude while reducing the memory consumption by up to more than a factor of 23.
Complete list of metadata

https://hal.inria.fr/hal-03431155
Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Monday, November 22, 2021 - 2:50:28 PM
Last modification on : Tuesday, September 6, 2022 - 1:27:27 PM

Files

domset-main-arxiv.pdf
Files produced by the author(s)

Identifiers

Citation

David Coudert, André Nusser, Laurent Viennot. Hyperbolicity Computation through Dominating Sets. ALENEX 2022 - SIAM Symposium on Algorithm Engineering and Experiments, Jan 2022, Alexandria, VA, United States. pp.78-90, ⟨10.1137/1.9781611977042.7⟩. ⟨hal-03431155v2⟩

Share

Metrics

Record views

121

Files downloads

82