Sublinear Random Access Generators for Preferential Attachment Graphs. (Q5111335)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sublinear Random Access Generators for Preferential Attachment Graphs. |
scientific article; zbMATH DE number 7204458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear Random Access Generators for Preferential Attachment Graphs. |
scientific article; zbMATH DE number 7204458 |
Statements
27 May 2020
0 references
local computation algorithms
0 references
preferential attachment graphs
0 references
random recursive trees
0 references
sublinear algorithms
0 references
Sublinear Random Access Generators for Preferential Attachment Graphs. (English)
0 references
0.7933985590934753
0 references
0.7538392543792725
0 references
0.7496190667152405
0 references
0.7366823554039001
0 references
0.7348833680152893
0 references
