A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376)
From MaRDI portal
scientific article; zbMATH DE number 7559049
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (English)
0 references
