A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7559049
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling |
scientific article; zbMATH DE number 7559049 |
Statements
18 July 2022
0 references
sublinear-time algorithms
0 references
subgraph counting
0 references
AGM bound
0 references
0 references
0 references
0 references
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (English)
0 references
0.8283785581588745
0 references
0.8094063401222229
0 references
0.8061597347259521
0 references
0.8017597794532776
0 references
0.8006904721260071
0 references
