Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks

Bhaskar DasGupta ()
Additional contact information
Bhaskar DasGupta: University of Illinois at Chicago, Department of Computer Science

A chapter in Optimization in Science and Engineering, 2014, pp 97-113 from Springer

Abstract: Abstract 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.

Keywords: Modularity Clustering; Model-based Clustering Framework; Designing Approximation Algorithms; Rounding Scheme; Null Model (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4939-0808-0_5

Ordering information: This item can be ordered from
http://www.springer.com/9781493908080

DOI: 10.1007/978-1-4939-0808-0_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().