A Lagrangian Relaxation Algorithm for Modularity Maximization Problem (Q2806937): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A dual ascent procedure for the set partitioning problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Stabilized column generation / rank | |||
Normal rank | |||
Latest revision as of 00:05, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Lagrangian Relaxation Algorithm for Modularity Maximization Problem |
scientific article |
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
