An efficient algorithm for solving pseudo clique enumeration problem (Q848935)
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 5674317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for solving pseudo clique enumeration problem |
scientific article; zbMATH DE number 5674317 |
Statements
An efficient algorithm for solving pseudo clique enumeration problem (English)
0 references
23 February 2010
0 references
dense subgraph
0 references
maximum subgraph
0 references
pseudo clique
0 references
quasi clique
0 references
dense structure
0 references
clustering
0 references
community discovering
0 references
enumeration
0 references
mining
0 references
algorithm
0 references
0 references
0.9822697043418884
0 references
0.806820273399353
0 references
0.7865294814109802
0 references
0.7247917652130127
0 references
0.7225046753883362
0 references
