Community detection with the weighted parsimony criterion

DOI10.1007/s11424-015-2169-6zbMath1329.93020OpenAlexW1975048673MaRDI QIDQ904925

Pierre Hansen, Andrea Bettinelli, Leo Liberti

Publication date: 14 January 2016

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-2169-6

zbMATH Keywords

parsimonycommunity detectioncomplex networks

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Large-scale systems (93A15)

Cites Work

• Unnamed Item
• Facets of the clique partitioning polytope
• A cutting plane algorithm for a clustering problem
• Thue equations and the method of Chabauty-Coleman.
• Detecting community structure: from parsimony to weighted parsimony
• The Complexity of Multiterminal Cuts
• Community structure in social and biological networks