Maximizing Modularity is hard
METADATA ONLY
Loading...
Author / Producer
Date
2006-08-25
Publication Type
Working Paper
ETH Bibliography
no
Citations
Altmetric
METADATA ONLY
Data
Rights / License
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.
Permanent link
Publication status
published
Editor
Book title
Journal / series
Volume
Pages / Article No.
608255
Publisher
Cornell University
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Data Analysis, Statistics and Probability (physics.data-an); Statistical Mechanics (cond-mat.stat-mech); Physics and Society (physics.soc-ph); FOS: Physical sciences
Organisational unit
09610 - Brandes, Ulrik / Brandes, Ulrik