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

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. We study diameter, radius and all eccentricity computations within the Helly graphs. Under plausible compl...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Journal of computer and system sciences Ročník 149; s. 103606
Hlavní autori: Dragan, Feodor F., Ducoffe, Guillaume, Guarnera, Heather M.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Inc 01.05.2025
Elsevier
Predmet:
Computational Complexity
Computer Science
Data Structures and Algorithms
Diameter
Eccentricities
Helly graphs
Hyperbolicity
Radius
Structural properties
Subquadratic graph algorithms
Radius
Helly graphs
Eccentricities
Subquadratic graph algorithms
Hyperbolicity
Diameter
Structural properties
Subquadratic Graph Algorithms
Helly Graphs
Structural Properties
ISSN:0022-0000, 1090-2724
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. 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 can be computed with high probability in O˜(mn) time (i.e., subquadratic in n+m). In this paper, we improve that result by presenting a deterministic O(mn)-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.
ISSN:0022-0000
1090-2724
DOI:10.1016/j.jcss.2024.103606