Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane

DOI10.4230/LIPIcs.ESA.2016.16zbMath1397.68136OpenAlexW2534694496MaRDI QIDQ4606285

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

zbMATH Keywords

embeddinghyperbolic planepower-law graphshyperbolic random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) 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) Graph algorithms (graph-theoretic aspects) (05C85) Elementary problems in hyperbolic and elliptic geometries (51M09)

Related Items (10)

Towards a Systematic Evaluation of Generative Network Models ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Limitations on realistic hyperbolic graph drawing ⋮ Geometric inhomogeneous random graphs ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ The diameter of KPKVB random graphs ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Hyperbolic Embeddings for Near-Optimal Greedy Routing

This page was built for publication: Efficient Embedding of Scale-Free Graphs in the Hyperbolic Plane