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 |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.9924402236938475
0 references
0.8611083626747131
0 references
0.8216025829315186
0 references
0.8213211894035339
0 references
0.8195552825927734
0 references
