Pages that link to "Item:Q3602902"
From MaRDI portal
The following pages link to Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs (Q3602902):
Displayed 44 items.
- Data center interconnection networks are not hyperbolic (Q301597) (← links)
- On the hyperbolicity of bipartite graphs and intersection graphs (Q317426) (← links)
- Differential geometric treewidth estimation in adiabatic quantum computation (Q332093) (← links)
- Metric embedding, hyperbolic space, and social networks (Q340518) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- On the hyperbolicity of random graphs (Q405243) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- \(k\)-chordal graphs: from cops and robber to compact routing via treewidth (Q494802) (← links)
- Constant approximation algorithms for embedding graph metrics into trees and outerplanar graphs (Q664543) (← links)
- Connected tree-width (Q722321) (← links)
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- Easy computation of eccentricity approximating trees (Q1741520) (← links)
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
- A review of two network curvature measures (Q1982207) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Algebraic characterisation of relatively hyperbolic special groups (Q2022780) (← links)
- On the joint spectral radius for isometries of non-positively curved spaces and uniform growth (Q2034719) (← links)
- Fellow travelers phenomenon present in real-world networks (Q2086588) (← links)
- Coning-off CAT(0) cube complexes (Q2115480) (← links)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
- Eccentricity terrain of \(\delta\)-hyperbolic graphs (Q2186812) (← links)
- A counterexample to Thiagarajan's conjecture on regular event structures (Q2186822) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- Applying clique-decomposition for computing Gromov hyperbolicity (Q2399620) (← links)
- Helly-gap of a graph and vertex eccentricities (Q2663046) (← links)
- Fast approximation and exact computation of negative curvature parameters of graphs (Q2664113) (← links)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- On the Complexity of Computing Treebreadth (Q2819486) (← links)
- Weakly Modular Graphs and Nonpositive Curvature (Q3380549) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- (Q5088964) (← links)
- Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs (Q5115790) (← links)
- Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs (Q5301013) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Parameterized approximation algorithms for some location problems in graphs (Q5915898) (← links)
- On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- First-order logic axiomatization of metric graph theory (Q6196830) (← links)