Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques (Q4598291)
From MaRDI portal
!
WARNING
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 6820337
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques |
scientific article; zbMATH DE number 6820337 |
Statements
19 December 2017
0 references
enumeration algorithms
0 references
maximal cliques
0 references
network mining and analytics
0 references
reverse search
0 references
space efficiency
0 references
0.9552019238471984
0 references
0.7895218729972839
0 references
0.768882155418396
0 references
0.7619813680648804
0 references
0.7605210542678833
0 references
