Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Maximizing Modularity is hard   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.

12
The categories of this paper are: nucl-th
30
The categories of this paper are: q-alg
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
18
The categories of this paper are: econ
16
The categories of this paper are: stat
15
The categories of this paper are: nucl-ex
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
25
The categories of this paper are: patt-sol
34
The categories of this paper are: chem-ph
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org