Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (Q1987232)
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: Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs |
scientific article; zbMATH DE number 7189175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs |
scientific article; zbMATH DE number 7189175 |
Statements
Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs (English)
0 references
14 April 2020
0 references
enumeration algorithms
0 references
maximal cliques
0 references
network mining and analytics
0 references
reverse search
0 references
space efficiency
0 references
polynomial-time delay
0 references
0 references
0 references
0 references
0 references
0 references
0.9552019238471984
0 references
0.8029547929763794
0 references
0.8019558787345886
0 references
0.7964246273040771
0 references
0.7769997715950012
0 references
