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

DOI10.4230/LIPICS.SEA.2017.26MaRDI QIDQ4580184zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Generating Random Hyperbolic Graphs in Subquadratic Time
• Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
• Linear-time generation of random chordal graphs
• Updating dynamic random hyperbolic graphs in sublinear time
• Exact and efficient generation of geometric random variates and random graphs
• Sublinear Random Access Generators for Preferential Attachment Graphs.
• Sublinear Random Access Generators for Preferential Attachment Graphs
• Generating random graphs with large girth
• Fast uniform generation of random graphs with given degree sequences
• scientific article; zbMATH DE number 5050599

Cited in

(7)

• Sublinear Random Access Generators for Preferential Attachment Graphs
• Sampling geometric inhomogeneous random graphs in linear time
• Generating Random Hyperbolic Graphs in Subquadratic Time
• From Graph Theory to Network Science: The Natural Emergence of Hyperbolicity (Tutorial)
• Updating dynamic random hyperbolic graphs in sublinear time
• Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs.
• Hyperbolic graph generator

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580184)