A framework of mapping undirected to directed graphs for community detection (Q528677)
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: A framework of mapping undirected to directed graphs for community detection |
scientific article; zbMATH DE number 6717711
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A framework of mapping undirected to directed graphs for community detection |
scientific article; zbMATH DE number 6717711 |
Statements
A framework of mapping undirected to directed graphs for community detection (English)
0 references
16 May 2017
0 references
community detection
0 references
modularity optimization
0 references
0 references
0 references
0.7410827279090881
0 references
0.7307758331298828
0 references
0.7250048518180847
0 references
0.7232150435447693
0 references
0.7209838032722473
0 references
