Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591)
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-time algorithms for counting star subgraphs via edge sampling |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.94422305
0 references
0.9307385
0 references
0.87771404
0 references
0 references
0.86518276
0 references
0.85879105
0 references
0.8557427
0 references
0.8555341
0 references
0.8553291
0 references
