Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
DOI10.4230/LIPICS.ESA.2016.16zbMATH Open1397.68136OpenAlexW2534694496MaRDI QIDQ4606285FDOQ4606285
Tobias Friedrich, Sören Laue, Anton Krohmer, Thomas Bläsius
Publication date: 2 March 2018
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.16
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Elementary problems in hyperbolic and elliptic geometries (51M09)
Cited In (12)
- From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
- The diameter of KPKVB random graphs
- Hyperbolic Embeddings for Near-Optimal Greedy Routing
- Towards a Systematic Evaluation of Generative Network Models
- Updating Dynamic Random Hyperbolic Graphs in Sublinear Time
- Sampling Geometric Inhomogeneous Random Graphs in Linear Time
- Geometric inhomogeneous random graphs
- Limitations on realistic hyperbolic graph drawing
- Geographical embedding of scale-free networks
- High-Speed and Noise-Robust Embedding of Hypergraphs Based on Double-Centered Incidence Matrix
- On the Diameter of Hyperbolic Random Graphs
- Greedy routing and the algorithmic small-world phenomenon
This page was built for publication: Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606285)
