Sublinear Random Access Generators for Preferential Attachment Graphs.
type: Item
instance of: scholarly article
zbMATH Open document ID: 1441.68177
author: Guy Even
author: Reut Levi
author: Moti Medina
author: Adi Rosén
publication date: 2020-05-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1602.06159
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 7204458
zbMATH Keywords: local computation algorithms
zbMATH Keywords: preferential attachment graphs
zbMATH Keywords: random recursive trees
zbMATH Keywords: sublinear algorithms
MaRDI profile type: MaRDI publication profile
arXiv ID: 1602.06159
OpenAlex ID: W3204625017
title: Sublinear Random Access Generators for Preferential Attachment Graphs.
DOI: 10.4230/LIPICS.ICALP.2017.6
Recommended article: Generating Massive Scale-Free Networks under Resource Constraints
Recommended article: Scalable generation of scale-free graphs
Recommended article: Random graphs associated to some discrete and continuous time preferential attachment models
Recommended article: On the number of subgraphs of the Barabási-Albert random graph
Recommended article: A Random-Surfer Web-Graph Model
description: scientific article; zbMATH DE number 7204458