A Lagrangian relaxation algorithm for modularity maximization problem (Q2806937)
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 Lagrangian relaxation algorithm for modularity maximization problem |
scientific article; zbMATH DE number 6582530
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian relaxation algorithm for modularity maximization problem |
scientific article; zbMATH DE number 6582530 |
Statements
A Lagrangian Relaxation Algorithm for Modularity Maximization Problem (English)
0 references
19 May 2016
0 references
tightly connected nodes
0 references
set partitioning problem
0 references
0.8428775072097778
0 references
0.7996116280555725
0 references
0.7950326204299927
0 references
0.7888898253440857
0 references
