Additive spanners and distance and routing labeling schemes for hyperbolic graphs
From MaRDI portal
Publication:2428695
Recommendations
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 1756017 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 1875437 (Why is no real title available?)
- scientific article; zbMATH DE number 849252 (Why is no real title available?)
- 1-Hyperbolic Graphs
- A note on distance approximating trees in graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Algorithms and Computation
- Approximate distance oracles
- Approximation algorithms for embedding general metrics into trees
- Bypassing the embedding
- Collective Tree Spanners and Routing in AT-free Related Graphs
- Collective tree spanners in graphs with bounded parameters
- Collective tree spanners of graphs
- Compact oracles for reachability and approximate distances in planar digraphs
- Compact routing schemes with low stretch factor
- Compact routing with minimum stretch
- Compact routing with slack in low doubling dimension
- Distance Approximating Trees for Chordal and Dually Chordal Graphs
- Distance and routing labeling schemes for non-positively curved plane graphs
- Distance estimation and object location via rings of neighbors
- Distance labeling in graphs
- Distance labeling scheme and split decomposition
- Distributed Computing: A Locality-Sensitive Approach
- Distributed approaches to triangulation and embedding
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
- Excluded minors, network decomposition, and multicommodity flow
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Gromov hyperbolicity of Denjoy domains
- Hyperbolic bridged graphs
- Labeling Schemes for Small Distances in Trees
- Localized and compact data-structure for comparability graphs
- Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs
- Object location using path separators
- On hierarchical routing in doubling metrics
- Optimal Distance Labeling for Interval Graphs and Related Graph Families
- Optimal scale-free compact routing schemes in networks of low doubling dimension
- Optimal-stretch name-independent compact routing in doubling metrics
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Proximity-preserving labeling schemes
- Query efficient implementation of graphs of bounded clique-width
- Reconstructing approximate tree metrics
- Space-efficiency for routing schemes of stretch factor three
- Spanners for bounded tree-length graphs
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- The Hilbert metric and Gromov hyperbolicity.
- Traveling with a Pez Dispenser (or, Routing Issues in MPLS)
- Tree-decompositions with bags of small diameter
Cited in
(21)- Computing the Gromov hyperbolicity of a discrete metric space
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Obstructions to a small hyperbolicity in Helly graphs
- Implicit representation of relations
- How to use spanning trees to navigate in graphs
- Fast approximation and exact computation of negative curvature parameters of graphs
- Algorithms and Computation
- On computing the Gromov hyperbolicity
- Fellow travelers phenomenon present in real-world networks
- Navigating the negative curvature of Google Maps
- A review of two network curvature measures
- On the hyperbolicity of random graphs
- Low distortion Delaunay embedding of trees in hyperbolic plane
- Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- Fast approximation and exact computation of negative curvature parameters of graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Mathematical properties on the hyperbolicity of interval graphs
- On computing the hyperbolicity of real-world graphs
This page was built for publication: Additive spanners and distance and routing labeling schemes for hyperbolic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428695)
