Algorithms and Computation

DOI10.1007/11602613zbMath1175.05050OpenAlexW2304246803MaRDI QIDQ5897938

Olivier Ly, Cyril Gavoille

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

zbMATH Keywords

hyperbolic graphsdistance labeling schemeDistance queries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Approximation algorithms (68W25)

Related Items (24)

The hyperbolicity constant of infinite circulant graphs ⋮ Obstructions to a small hyperbolicity in Helly graphs ⋮ Computing the hyperbolicity constant of a cubic graph ⋮ Gromov hyperbolicity of planar graphs ⋮ Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) ⋮ Unnamed Item ⋮ On the hyperbolicity constant in graphs ⋮ Additive spanners and distance and routing labeling schemes for hyperbolic graphs ⋮ Computing the hyperbolicity constant ⋮ Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications ⋮ Characterization of Gromov hyperbolic short graphs ⋮ Gromov hyperbolicity of periodic planar graphs ⋮ Gromov hyperbolicity in lexicographic product graphs ⋮ Distance and routing labeling schemes for cube-free median graphs ⋮ Distributed Relationship Schemes for Trees ⋮ On the hyperbolicity constant in graph minors ⋮ A review of two network curvature measures ⋮ Hyperbolicity in the corona and join of graphs ⋮ Hyperbolicity in median graphs ⋮ Gromov hyperbolicity of periodic graphs ⋮ Small values of the hyperbolicity constant in graphs ⋮ Unnamed Item ⋮ Decomposing a graph into shortest paths with bounded eccentricity ⋮ Distance labeling schemes for \(K_4\)-free bridged graphs

This page was built for publication: Algorithms and Computation