Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Maximizing Barber's bipartite modularity is also hard   Modularity introduced by Newman and Girvan [Phys. Rev. E 69, 026113 (2004)]
is a quality function for community detection. Numerous methods for modularity
maximization have been developed so far. In 2007, Barber [Phys. Rev. E 76,
066102 (2007)] introduced a variant of modularity called bipartite modularity
which is appropriate for bipartite networks. Although maximizing the standard
modularity is known to be NP-hard, the computational complexity of maximizing
bipartite modularity has yet to be revealed. In this study, we prove that
maximizing bipartite modularity is also NP-hard. More specifically, we show the
NP-completeness of its decision version by constructing a reduction from a
classical partitioning problem.

26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
29
The categories of this paper are: funct-an
10
The categories of this paper are: q-bio
16
The categories of this paper are: stat
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph
31
The categories of this paper are: ao-sci
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th
18
The categories of this paper are: econ
22
The categories of this paper are: chao-dyn
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th