Notes on diameters, centers, and approximating trees of -hyperbolic geodesic spaces and graphs
From MaRDI portal
Publication:5301013
DOI10.1016/J.ENDM.2008.06.046zbMATH Open1267.05077OpenAlexW2092489941MaRDI QIDQ5301013FDOQ5301013
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
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
Cited In (24)
- The hyperbolicity constant of infinite circulant graphs
- Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs
- Mathematical properties on the hyperbolicity of interval graphs
- Gromov hyperbolicity in Mycielskian graphs
- Several extremal problems on graphs involving the circumference, girth, and hyperbolicity constant
- Mathematical properties of the hyperbolicity of circulant networks
- Bounds on the hyperbolicity constant
- Bounds on Gromov hyperbolicity constant in graphs
- Gromov hyperbolicity in Cartesian product graphs
- Gromov hyperbolicity in strong product graphs
- Generalized chordality, vertex separators and hyperbolicity on graphs
- On a classical theorem on the diameter and minimum degree of a graph
- On the hyperbolicity constant of circular-arc graphs
- Chordality properties and hyperbolicity on graphs
- How to Use Spanning Trees to Navigate in Graphs
- Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs
- Bounds on Gromov hyperbolicity constant
- Computing the hyperbolicity constant of a cubic graph
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- Hyperbolicity in median graphs
- Characterization of Gromov hyperbolic short graphs
- On computing the hyperbolicity of real-world graphs
- On computing the Gromov hyperbolicity
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)