A fast and efficient algorithm to identify clusters in networks

DOI10.1016/J.AMC.2010.06.060zbMath1207.68033OpenAlexW2141263194WikidataQ57772698 ScholiaQ57772698MaRDI QIDQ606725

Alicia Miralles, Francesc Comellas

Publication date: 18 November 2010

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/2591

zbMATH Keywords

networksgraphsclusterscomplex systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Pattern recognition, speech recognition (68T10)

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• On Finding Graph Clusterings with Maximum Modularity
• The Structure and Function of Complex Networks
• Community structure in social and biological networks

This page was built for publication: A fast and efficient algorithm to identify clusters in networks