Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory

DOI10.4230/LIPICS.SEA.2017.26zbMath1433.68306OpenAlexW2750600085MaRDI QIDQ4580184

Manuel Penschuck

Publication date: 13 August 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7621/pdf/LIPIcs-SEA-2017-26.pdf/

zbMATH Keywords

streaming algorithmrandom hyperbolic graph generator

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ⋮ From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)

This page was built for publication: Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory