Post-processing hierarchical community structures: quality improvements and multi-scale view

DOI10.1016/J.TCS.2010.11.041zbMath1206.68042OpenAlexW2094983534MaRDI QIDQ627194

Matthieu Latapy, Pascal Pons

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.11.041

zbMATH Keywords

graph algorithmhierarchical clusteringcommunity detectioncomplex network

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Assessing the quality of multilevel graph clustering ⋮ An information-theoretic framework for the lossy compression of link streams

Cites Work

• Unnamed Item
• A clustering algorithm based on graph connectivity
• Metric structure of random networks
• Network analysis. Methodological foundations.
• Statistical mechanics of complex networks
• Detecting network communities: a new systematic and efficient algorithm
• The Structure and Function of Complex Networks
• Fast unfolding of communities in large networks
• Computing Communities in Large Networks Using Random Walks
• Exploring complex networks

This page was built for publication: Post-processing hierarchical community structures: quality improvements and multi-scale view