Fast approximation and exact computation of negative curvature parameters of graphs
From MaRDI portal
Publication:5115790
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
Cites work
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- scientific article; zbMATH DE number 6850484 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 849252 (Why is no real title available?)
- scientific article; zbMATH DE number 849253 (Why is no real title available?)
- scientific article; zbMATH DE number 848089 (Why is no real title available?)
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Approximation algorithms for the Gromov hyperbolicity of discrete metric spaces
- Computing the Gromov hyperbolicity of a discrete metric space
- Core congestion is inherent in hyperbolic networks
- Courbure mésoscopique et théorie de la toute petite simplification
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- 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
- Fast approximation and exact computation of negative curvature parameters of graphs
- Gromov hyperbolicity and cop and robber game
- Into the square: on the complexity of some quadratic-time solvable problems
- Metric embedding, hyperbolic space, and social networks
- On computing the Gromov hyperbolicity
- On computing the hyperbolicity of real-world graphs
- On infinite bridged graphs and strongly dismantlable graphs
- Packing and Covering δ-Hyperbolic Spaces by Balls
- Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- The level ancestor problem simplified
- Weak hyperbolicity of cube complexes and quasi-arboreal groups
- When can graph hyperbolicity be computed in linear time?
Cited in
(15)- Scaled Gromov four-point condition for network graph curvature computation
- A review of two network curvature measures
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- 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)
- 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
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)
