Fast approximation and exact computation of negative curvature parameters of graphs
DOI10.4230/LIPICS.SOCG.2018.22zbMATH Open1489.68346OpenAlexW4391463207MaRDI QIDQ5115790FDOQ5115790
Authors: J. Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem O. Mohammed, Yann Vaxès 
Publication date: 18 August 2020
Full work available at URL: https://hal.science/hal-01836063
Recommendations
- Fast approximation and exact computation of negative curvature parameters of graphs
- On computing the Gromov hyperbolicity
- Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces
- Computing the Gromov hyperbolicity of a discrete metric space
- On computing the hyperbolicity of real-world graphs
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Metric spaces, metrizability (54E35)
Cites Work
- Title not available (Why is that?)
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The level ancestor problem simplified
- Title not available (Why is that?)
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Courbure mésoscopique et théorie de la toute petite simplification
- On computing the Gromov hyperbolicity
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- Metric embedding, hyperbolic space, and social networks
- Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs
- On computing the hyperbolicity of real-world graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- On infinite bridged graphs and strongly dismantlable graphs
- An improved combinatorial algorithm for Boolean matrix multiplication
- Title not available (Why is that?)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Gromov hyperbolicity and cop and robber game
- Weak hyperbolicity of cube complexes and quasi-arboreal groups
- Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces
- Into the square: on the complexity of some quadratic-time solvable problems
- Fast approximation and exact computation of negative curvature parameters of graphs
- Core congestion is inherent in hyperbolic networks
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs
- Title not available (Why is that?)
- When can graph hyperbolicity be computed in linear time?
Cited In (15)
- A review of two network curvature measures
- Fast approximation and exact computation of negative curvature parameters of graphs
- Eccentricity terrain of \(\delta\)-hyperbolic graphs
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Computing the Gromov hyperbolicity of a discrete metric space
- When can graph hyperbolicity be computed in linear time?
- Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces
- Fast approximation and exact computation of negative curvature parameters of graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- On computing the hyperbolicity of real-world graphs
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- On computing the Gromov hyperbolicity
- Scaled Gromov four-point condition for network graph curvature computation
This page was built for publication: Fast approximation and exact computation of negative curvature parameters of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115790)
