Maximizing Barber's bipartite modularity is also hard (Q2355315)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximizing Barber's bipartite modularity is also hard |
scientific article |
Statements
Maximizing Barber's bipartite modularity is also hard (English)
0 references
22 July 2015
0 references
network analysis
0 references
community detection
0 references
modularity maximization
0 references
bipartite networks
0 references
computational complexity
0 references
0 references
