Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
From MaRDI portal
Publication:3602902
Cited in
(48)- A counterexample to Thiagarajan's conjecture on regular event structures
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth
- Obstructions to a small hyperbolicity in Helly graphs
- To approximate treewidth, use treelength!
- Tree decompositions and social graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Weakly Modular Graphs and Nonpositive Curvature
- On the joint spectral radius for isometries of non-positively curved spaces and uniform growth
- How to use spanning trees to navigate in graphs
- Fast approximation and exact computation of negative curvature parameters of graphs
- $$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
- Fellow travelers phenomenon present in real-world networks
- On the complexity of computing treebreadth
- On the complexity of computing treebreadth
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Leanness computation: small values and special graph classes
- A review of two network curvature measures
- Helly-gap of a graph and vertex eccentricities
- scientific article; zbMATH DE number 7559234 (Why is no real title available?)
- On the hyperbolicity of random graphs
- Into the square: on the complexity of some quadratic-time solvable problems
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs
- Applying clique-decomposition for computing Gromov hyperbolicity
- Topologically trivial closed walks in directed surface graphs
- Notes on diameters, centers, and approximating trees of \(\delta\)-hyperbolic geodesic spaces and graphs
- On computing the diameter of real-world undirected graphs
- Helly groups
- Data center interconnection networks are not hyperbolic
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Coning-off CAT(0) cube complexes
- Connected tree-width
- First-order logic axiomatization of metric graph theory
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
- On the hyperbolicity of bipartite graphs and intersection graphs
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions
- Fast approximation and exact computation of negative curvature parameters of graphs
- Differential geometric treewidth estimation in adiabatic quantum computation
- Beyond Helly graphs: the diameter problem on absolute retracts
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Metric embedding, hyperbolic space, and social networks
- Easy computation of eccentricity approximating trees
- A story of diameter, radius, and (almost) Helly property
- Algebraic characterisation of relatively hyperbolic special groups
- Eccentricity terrain of \(\delta\)-hyperbolic graphs
This page was built for publication: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602902)
