Maximizing Barber's bipartite modularity is also hard

DOI10.1007/s11590-014-0818-7zbMath1328.90152arXiv1310.4656OpenAlexW3103232784MaRDI QIDQ2355315

Atsushi Miyauchi, Noriyoshi Sukegawa

Publication date: 22 July 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.4656

zbMATH Keywords

computational complexitynetwork analysiscommunity detectionbipartite networksmodularity maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items

Additive approximation algorithms for modularity maximization ⋮ Quantitative function and algorithm for community detection in bipartite networks

Cites Work

• Unnamed Item
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Modularity-maximizing graph communities via mathematical programming
• Finding community structures in complex networks using mixed integer optimisation
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
• Shock velocity in weakly ionized nitrogen, air, and argon
• The Structure and Function of Complex Networks
• Fast unfolding of communities in large networks

This page was built for publication: Maximizing Barber's bipartite modularity is also hard