Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs

  • Authors:

  • Victor Chepoi;Feodor Dragan;Bertrand Estellon;Michel Habib;Yann Vaxès

  • Affiliations:

  • LIF, Faculté des Sciences de Luminy, Universite de la Mediterranee, Marseille, France;Kent State University, Kent, OH, USA;LIF, Faculté des Sciences de Luminy, Universite de la Mediterranee, Marseille, France;LIAFA, Universite Diderot-Paris 7, Paris, France;LIF, Faculté des Sciences de Luminy, Universite de la Mediterranee, Marseille, France

  • Venue:
  • Proceedings of the twenty-fourth annual symposium on Computational geometry
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

δ-Hyperbolic metric spaces have been defined by M. Gromov via a simple 4-point condition: for any four points u,v,w,x, the two larger of the sums d(u,v)+d(w,x), d(u,w)+d(v,x), d(u,x)+d(v,w) differ by at most 2δ. Given a finite set S of points of a δ-hyperbolic space, we present simple and fast methods for approximating the diameter of S with an additive error 2δ and computing an approximate radius and center of a smallest enclosing ball for S with an additive error 3δ. These algorithms run in linear time for classical hyperbolic spaces and for δ-hyperbolic graphs and networks. Furthermore, we show that for δ-hyperbolic graphs G=(V,E) with uniformly bounded degrees of vertices, the exact center of S can be computed in linear time O(|E|). We also provide a simple construction of distance approximating trees of δ-hyperbolic graphs G on n vertices with an additive error O(δlog2 n). This construction has an additive error comparable with that given by Gromov for n-point δ-hyperbolic spaces, but can be implemented in O(|E|) time (instead of O(n2)). Finally, we establish that several geometrical classes of graphs have bounded hyperbolicity.