On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700)
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: On Approximating the Number of $k$-Cliques in Sublinear Time |
scientific article; zbMATH DE number 7236282
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Approximating the Number of $k$-Cliques in Sublinear Time |
scientific article; zbMATH DE number 7236282 |
Statements
On Approximating the Number of $k$-Cliques in Sublinear Time (English)
0 references
18 August 2020
0 references
sublinear algorithms
0 references
counting cliques
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
