Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory (Q4580184)
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: Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory |
scientific article; zbMATH DE number 6917141
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory |
scientific article; zbMATH DE number 6917141 |
Statements
13 August 2018
0 references
random hyperbolic graph generator
0 references
streaming algorithm
0 references
Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory (English)
0 references
0.9646701
0 references
0.91366446
0 references
0 references
0.8774955
0 references
0.8743123
0 references
0.87089527
0 references
0.87089527
0 references
0.8624888
0 references
0.86172825
0 references
