Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2021

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

Abstract

A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. The class of Helly graphs is the discrete analogue of the class of hyperconvex metric spaces. It is also known that every graph isometrically embeds into a Helly graph, making the latter an important class of graphs in Metric Graph Theory. We study diameter, radius and all eccentricity computations within the Helly graphs. Under plausible complexity assumptions, neither the diameter nor the radius can be computed in truly subquadratic time on general graphs. In contrast to these negative results, it was recently shown that the radius and the diameter of an n-vertex m-edge Helly graph G can be computed with high probability inÕ(m √ n) time (i.e., subquadratic in n+m). In this paper, we improve that result by presenting a deterministic O(m √ n) time algorithm which computes not only the radius and the diameter but also all vertex eccentricities in a Helly graph. Furthermore, we give a parameterized linear-time algorithm for this problem on Helly graphs, with the parameter being the Gromov hyperbolicity δ. More specifically, we show that the radius and a central vertex of an m-edge δ-hyperbolic Helly graph G can be computed in O(δm) time and that all vertex eccentricities in G can be computed in O(δ 2 m) time. To show this more general result, we heavily use our new structural properties obtained for Helly graphs.
Fichier principal
Vignette du fichier
WADS_2021.pdf (326.04 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03315928 , version 1 (06-08-2021)

Identifiers

Cite

Feodor F Dragan, Guillaume Ducoffe, Heather M Guarnera. Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. Algorithms and Data Structures 17th International Symposium (WADS 2021), Aug 2021, Halifax, Nova Scotia (Virtual Event), Canada. pp.300-314, ⟨10.1007/978-3-030-83508-8_22⟩. ⟨hal-03315928⟩
17 View
113 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More