Name
Abstract | ||
|---|---|---|
Community detection in graphs aims at identifying modules within a network and, possibly, their hierarchical organization by only using the information encoded in the graph modeling the network. Generally speaking, a community in a network is a subset of its nodes showing higher degree of interconnection with each other than to the remaining nodes. This is an informal characterization and different formal definitions of communities have been proposed in the literature, also in relation to the available information. For most such definitions, the problem of detecting a proper partition of the given network into a prefixed number of community is NP-hard. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.tcs.2015.11.034 | Theoretical Computer Science |
Keywords | DocType | Volume |
Graph theory,Community discovery,Graph partitioning | Journal | 613 |
Issue | ISSN | Citations |
C | 0304-3975 | 1 |
PageRank | References | Authors |
0.35 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miriam di Ianni | 1 | 144 | 17.27 |
| Giorgio Gambosi | 2 | 315 | 45.52 |
| Gianluca Rossi | 3 | 235 | 21.60 |
| Paola Vocca | 4 | 225 | 24.79 |