Eccentricity terrain of \(\delta\)-hyperbolic graphs
From MaRDI portal
Publication:2186812
DOI10.1016/j.jcss.2020.03.004zbMath1450.05017arXiv2002.08495OpenAlexW3006886793WikidataQ115571244 ScholiaQ115571244MaRDI QIDQ2186812
Feodor F. Dragan, Heather M. Guarnera
Publication date: 9 June 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.08495
convexityapproximation algorithmdiameterradiuscomplex network analysisGromov hyperbolicityeccentricity terrain
Related Items (3)
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ Helly-gap of a graph and vertex eccentricities ⋮ Eccentricity function in distance-hereditary graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Eccentricity-approximating trees in chordal graphs
- Obstructions to a small hyperbolicity in Helly graphs
- Easy computation of eccentricity approximating trees
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
- Computing the Gromov hyperbolicity of a discrete metric space
- Eccentricity approximating trees
- On Computing the Hyperbolicity of Real-World Graphs
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Core congestion is inherent in hyperbolic networks
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Network Analysis
- Tree decompositions and social graphs
This page was built for publication: Eccentricity terrain of \(\delta\)-hyperbolic graphs
