A general view on computing communities
From MaRDI portal
Recommendations
- Min-max communities in graphs: complexity and computational properties
- Detecting communities is hard (and counting them is even harder)
- Structural and algorithmic properties of 2-community structures
- The maximum community partition problem in networks
- New insight into 2-community structures in graphs with applications in social networks
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- Algorithms for graph partitioning on the planted partition model
- Communities in Large Networks: Identification and Ranking
- Graph Clustering and Minimum Cut Trees
- Graph clustering
- Maximizing edge-ratio is NP-complete
- Nash stability in additively separable hedonic games and community structures
- SOFSEM 2006: Theory and Practice of Computer Science
Cited in
(11)- Structural and algorithmic properties of 2-community structures
- Graphs without a partition into two proportionally dense subgraphs
- Efficient and effective community search
- Hierarchies of predominantly connected communities
- Min-max communities in graphs: complexity and computational properties
- Detecting communities is hard (and counting them is even harder)
- New insight into 2-community structures in graphs with applications in social networks
- Proportionally dense subgraph of maximum size: complexity and approximation
- Exhaustive community enumeration in parallel
- Finding a potential community in networks
- Finding \(k\)-community structures in special graph classes
This page was built for publication: A general view on computing communities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q459400)
