Maximizing Barber’s bipartite modularity is also hard

Title
Maximizing Barber’s bipartite modularity is also hard
Authors
Keywords
Network analysis, Community detection, Modularity maximization, Bipartite networks, Computational complexity
Journal
Optimization Letters
Volume 9, Issue 5, Pages 897-913
Publisher
Springer Nature
Online
2014-10-22
DOI
10.1007/s11590-014-0818-7

Ask authors/readers for more resources

Reprint

Contact the author

Find the ideal target journal for your manuscript

Explore over 38,000 international journals covering a vast array of academic fields.

Search

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now