Community detection with the weighted parsimony criterion
From MaRDI portal
(Redirected from Publication:904925)
Recommendations
- Detecting community structure: from parsimony to weighted parsimony
- Community detection for weighted networks with unknown number of communities
- Enhancing community detection using a network weighting strategy
- scientific article; zbMATH DE number 6982944
- scientific article; zbMATH DE number 6907813
- Quantitative measure for community detection in weighted networks
- Toward optimal community detection: from trees to general weighted networks
- Weighted community detection and data clustering using message passing
Cites work
- A cutting plane algorithm for a clustering problem
- Community structure in social and biological networks
- Detecting community structure: from parsimony to weighted parsimony
- Facets of the clique partitioning polytope
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- The Complexity of Multiterminal Cuts
- Thue equations and the method of Chabauty-Coleman.
Cited in
(6)- Computing exact \(p\)-values for community detection
- Detecting community structure: from parsimony to weighted parsimony
- scientific article; zbMATH DE number 6907813 (Why is no real title available?)
- scientific article; zbMATH DE number 6982944 (Why is no real title available?)
- Finding weighted k-truss communities in large networks
- Min-max communities in graphs: complexity and computational properties
This page was built for publication: Community detection with the weighted parsimony criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904925)