Back to Search Start Over

Maximizing Modularity is hard

Authors :
Brandes, U.
Delling, D.
Gaertler, M.
Goerke, R.
Hoefer, M.
Nikoloski, Z.
Wagner, D.
Publication Year :
2006
Publisher :
arXiv, 2006.

Abstract

Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these algorithms typically contain experimental evaluations to emphasize the plausibility of results, none of these algorithms has been shown to actually compute optimal partitions. We here settle the unknown complexity status of modularity maximization by showing that the corresponding decision version is NP-complete in the strong sense. As a consequence, any efficient, i.e. polynomial-time, algorithm is only heuristic and yields suboptimal partitions on many instances.<br />Comment: 10 pages, 1 figure

Details

Database :
OpenAIRE
Accession number :
edsair.doi.dedup.....8312e3b440aa515cc1576d3b655375d1
Full Text :
https://doi.org/10.48550/arxiv.physics/0608255