Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sublinear-time algorithms for counting star subgraphs via edge sampling |
scientific article |
Statements
Sublinear-time algorithms for counting star subgraphs via edge sampling (English)
0 references
6 April 2018
0 references
subgraphs
0 references
approximate counting
0 references
randomized algorithms
0 references
sublinear-time algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
