Complete graph model for community detection

DOI10.1016/j.physa.2016.12.014zbMath1400.68161OpenAlexW2561235788MaRDI QIDQ1620452

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

bipartitecomplete graphcommunity detection

Mathematics Subject Classification ID

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

Cites Work

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

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