Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient (Q1782802)
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: Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient |
scientific article; zbMATH DE number 6939940
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient |
scientific article; zbMATH DE number 6939940 |
Statements
Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient (English)
0 references
20 September 2018
0 references
complex network
0 references
community structures
0 references
maximal sub-graph
0 references
clustering coefficient
0 references
0 references
