On approximating the number of k-cliques in sublinear time (Q5230333)
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 7097039
| 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 7097039 |
Statements
On approximating the number of k-cliques in sublinear time (English)
0 references
22 August 2019
0 references
approximation algorithms
0 references
counting cliques
0 references
sublinear algorithms
0 references
0.9999996
0 references
0.9498021
0 references
0.9163676
0 references
0 references
0.91099334
0 references
0.90962297
0 references
0.90884584
0 references
0.89765835
0 references
0.8927011
0 references
