Sublinear Random Access Generators for Preferential Attachment Graphs

DOI10.1145/3464958OpenAlexW2963965835MaRDI QIDQ5035872

Moti Medina, Adi Rosén, Reut Levi, Guy Even

Publication date: 22 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7424/

zbMATH Keywords

sublinear algorithmslocal computation algorithmsrandom graph generatorpreferential attachment graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

This page was built for publication: Sublinear Random Access Generators for Preferential Attachment Graphs