Local community detection in complex networks based on maximum cliques extension

DOI10.1155/2014/653670zbMath1407.91199OpenAlexW1985497632WikidataQ59068667 ScholiaQ59068667MaRDI QIDQ1718879

Zhu Mu, Zhou Yong, Zhou Ranran, Meng Fanrong

Publication date: 8 February 2019

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2014/653670

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Local community detection based on small cliques

Uses Software

• Algorithm 457

Cites Work

• Semisupervised clustering for networks based on fast affinity propagation
• The worst-case time complexity for generating all maximal cliques and computational experiments
• WEIGHTED EVOLVING NETWORKS WITH INTRINSIC STRENGTH
• Community structure in social and biological networks
• A classification for community discovery methods in complex networks
• Overlapping community detection in networks
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Local community detection in complex networks based on maximum cliques extension