The maximum community partition problem in networks

DOI10.1142/S1793830913500316MaRDI QIDQ2874043zbMATH OpenFDO

Authors Zaixin Lu, Weili Wu, Weidong Chen, Jiaofei Zhong, Yuanjun Bi, Zheng Gao

Publication date 28 January 2014

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830913500316

zbMATH Keywords

\(\mathcal{NP}\)-hardcommunity partition

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Toward optimal community detection: from trees to general weighted networks
• Min-max communities in graphs: complexity and computational properties
• Maximum modular graphs
• Modularity-maximizing graph communities via mathematical programming
• Community detection by modularity maximization using GRASP with path relinking

Cites work

• A combinatorial model and algorithm for globally searching community structure in complex networks
• Community structure in social and biological networks
• Graph clustering
• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• On clusterings: good, bad and spectral

Cited in

(9)

• Mixed-case community detection problem in social networks: algorithms and analysis
• Maximizing Barber's bipartite modularity is also hard
• A general view on computing communities
• Adding cohesion constraints to models for modularity maximization in networks
• Toward optimal community detection: from trees to general weighted networks
• Social network analysis and applications: A review of the broad research aspects of social network structure
• Community-Based Partitioning for MaxSAT Solving
• Optimizing edge sets in networks to produce ground truth communities based on modularity
• Min-max communities in graphs: complexity and computational properties

This page was built for publication: The maximum community partition problem in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874043)