Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
From MaRDI portal
Publication:5405047
DOI10.1007/978-3-642-54423-1_25zbMath1328.68299OpenAlexW1481725661MaRDI QIDQ5405047
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_25
Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (5)
Fast approximation and exact computation of negative curvature parameters of graphs ⋮ Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) ⋮ On Computing the Gromov Hyperbolicity ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs ⋮ Fellow travelers phenomenon present in real-world networks
This page was built for publication: Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces