Traversing a graph for identifying communities (Q3110102)
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 6000755
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Traversing a graph for identifying communities |
scientific article; zbMATH DE number 6000755 |
Statements
26 January 2012
0 references
community detection algorithms
0 references
complex networks
0 references
graph transversal greedy algorithm
0 references
internal density of a community
0 references
external density of a community
0 references
addition phase
0 references
deletion phase
0 references
community detection algorithm
0 references
seed note
0 references
synthetic GN graphs
0 references
college football games
0 references
0.7516268491744995
0 references
0.7513151168823242
0 references
0.7500246167182922
0 references
0.7371567487716675
0 references
0.7335405945777893
0 references
