An extremely popular model-based graph partitioning approach that is used for both biological and social networks is the so-called modularity optimization approach originally proposed by Newman and its variations. In this chapter, we review several combinatorial and algebraic methods that have been used in the literature to study the computational complexities of these optimization problems.
CITATION STYLE
Dasgupta, B. (2014). Computational complexities of optimization problems related to model-based clustering of networks. In Optimization in Science and Engineering: In Honor of the 60th Birthday of Panos M. Pardalos (Vol. 9781493908080, pp. 97–113). Springer New York. https://doi.org/10.1007/978-1-4939-0808-0_5
Mendeley helps you to discover research relevant for your work.