Complete graph model for community detection

DOI10.1016/J.PHYSA.2016.12.014MaRDI QIDQ1620452zbMATH OpenOpenAlexFDO

Authors Peng Gang Sun, Xiya Sun

Publication date 13 November 2018

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2016.12.014

zbMATH Keywords

bipartitecommunity detectioncomplete graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Min-max communities in graphs: complexity and computational properties
• Searching for communities in bipartite networks
• Modularity maximization using completely positive programming
• Community detection by using the extended modularity
• scientific article; zbMATH DE number 5533285

Cites work

• A classification for community discovery methods in complex networks
• A framework of mapping undirected to directed graphs for community detection
• Adequate is better: particle swarm optimization with limited-information
• Community structure in social and biological networks
• Exploring complex networks
• Fast unfolding of communities in large networks
• Identification of overlapping and non-overlapping community structure by fuzzy clustering in complex networks
• Imbalance problem in community detection
• Maximizing modularity intensity for community partition and evolution
• Optimization by simulated annealing
• Statistical mechanics of complex networks

This page was built for publication: Complete graph model for community detection

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