On the Complexity of Sampling Vertices Uniformly from a Graph (Q5002838)
From MaRDI portal
scientific article; zbMATH DE number 7376076
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Complexity of Sampling Vertices Uniformly from a Graph |
scientific article; zbMATH DE number 7376076 |
Statements
28 July 2021
0 references
social networks
0 references
sampling
0 references
graph exploration
0 references
lower bounds
0 references
0 references
0 references
On the Complexity of Sampling Vertices Uniformly from a Graph (English)
0 references
