Generating Random Hyperbolic Graphs in Subquadratic Time

DOI10.1007/978-3-662-48971-0_40zbMath1472.68123OpenAlexW2401915092MaRDI QIDQ3459884

Moritz von Looz, Roman Prutkin, Henning Meyerhenke

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_40

zbMATH Keywords

hyperbolic geometrycomplex networksefficient range querygenerative graph modelpolar quadtree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Randomized algorithms (68W20) Graph representations (geometric and intersection representations, etc.) (05C62) Elementary problems in hyperbolic and elliptic geometries (51M09)

Related Items (11)

On the Diameter of Hyperbolic Random Graphs ⋮ On the Diameter of Hyperbolic Random Graphs ⋮ Fully-Dynamic Approximation of Betweenness Centrality ⋮ Geometric inhomogeneous random graphs ⋮ Updating Dynamic Random Hyperbolic Graphs in Sublinear Time ⋮ Practical Minimum Cut Algorithms ⋮ Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ⋮ Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial) ⋮ Sampling Geometric Inhomogeneous Random Graphs in Linear Time ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks

This page was built for publication: Generating Random Hyperbolic Graphs in Subquadratic Time