Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
From MaRDI portal
Publication:5115790
DOI10.4230/LIPIcs.SoCG.2018.22zbMath1489.68346OpenAlexW4391463207MaRDI QIDQ5115790
Abdulhakeem O. Mohammed, Victor Chepoi, Yann Vaxès, Feodor F. Dragan, Guillaume Ducoffe, Jérémie Chalopin
Publication date: 18 August 2020
Full work available at URL: https://hal.science/hal-01836063
Graph theory (including graph drawing) in computer science (68R10) Metric spaces, metrizability (54E35) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items (7)
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs ⋮ 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) ⋮ Eccentricity terrain of \(\delta\)-hyperbolic graphs ⋮ A review of two network curvature measures ⋮ Fast approximation of eccentricities and distances in hyperbolic graphs ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The level ancestor problem simplified
- Into the square: on the complexity of some quadratic-time solvable problems
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- An improved combinatorial algorithm for Boolean matrix multiplication
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- On infinite bridged graphs and strongly dismantlable graphs
- Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- On Computing the Gromov Hyperbolicity
- Weak hyperbolicity of cube complexes and quasi-arboreal groups
- Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
- On Computing the Hyperbolicity of Real-World Graphs
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Core congestion is inherent in hyperbolic networks
- Metric Embedding, Hyperbolic Space, and Social Networks
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
- Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces
- Courbure mésoscopique et théorie de la toute petite simplification
- When can graph hyperbolicity be computed in linear time?
This page was built for publication: Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
