HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Hyperbolicity Computation through Dominating Sets

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

Contributor : Laurent Viennot Connect in order to contact the contributor
Submitted on : Monday, November 22, 2021 - 2:50:28 PM
Last modification on : Sunday, May 1, 2022 - 3:17:37 AM


Files produced by the author(s)



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⟩



Record views


Files downloads