Notes on diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs

DOI10.1016/J.ENDM.2008.06.046MaRDI QIDQ5301013zbMATH OpenOpenAlexFDO

Authors Victor Chepoi, Feodor F. Dragan, Bertrand Estellon, Yann Vaxès, M. A. Habib

Publication date 28 June 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2008.06.046

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Recommendations

• Packing and Covering δ-Hyperbolic Spaces by Balls
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs
• Fast approximation of eccentricities and distances in hyperbolic graphs
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
• Fast approximation of centrality and distances in hyperbolic graphs

Cites work

• A note on distance approximating trees in graphs
• Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)

Cited in

(24)

• Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
• Gromov hyperbolicity in strong product graphs
• Mathematical properties of the hyperbolicity of circulant networks
• On the hyperbolicity constant of circular-arc graphs
• Bounds on the hyperbolicity constant
• On computing the Gromov hyperbolicity
• Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs
• Gromov hyperbolicity in Mycielskian graphs
• On a classical theorem on the diameter and minimum degree of a graph
• The hyperbolicity constant of infinite circulant graphs
• Computing the hyperbolicity constant of a cubic graph
• Characterization of Gromov hyperbolic short graphs
• Chordality properties and hyperbolicity on graphs
• Additive spanners and distance and routing labeling schemes for hyperbolic graphs
• How to Use Spanning Trees to Navigate in Graphs
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
• Bounds on Gromov hyperbolicity constant in graphs
• Bounds on Gromov hyperbolicity constant
• Gromov hyperbolicity in Cartesian product graphs
• Mathematical properties on the hyperbolicity of interval graphs
• Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
• On computing the hyperbolicity of real-world graphs
• Hyperbolicity in median graphs
• Generalized chordality, vertex separators and hyperbolicity on graphs

This page was built for publication: Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301013)