A simple approach for lower-bounding the distortion in any hyperbolic embedding
From MaRDI portal
(Redirected from Publication:1689928)
Recommendations
Cites work
- A game of cops and robbers
- Characterizing ( ,m)-walk-regular graphs
- Cop and robber game and hyperbolicity
- Data center interconnection networks are not hyperbolic
- Distance degree regular graphs
- Distance-regularised graphs are distance-regular or distance-biregular
- Graph theory
- scientific article; zbMATH DE number 4031953 (Why is no real title available?)
- Hyperbolicity and chordality of a graph
- Metric embedding, hyperbolic space, and social networks
- On computing the hyperbolicity of real-world graphs
- On the hyperbolicity of bipartite graphs and intersection graphs
Cited in
(5)
This page was built for publication: A simple approach for lower-bounding the distortion in any hyperbolic embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689928)