Min-max communities in graphs: complexity and computational properties
DOI10.1016/J.TCS.2015.11.034zbMATH Open1333.05237OpenAlexW2474071255MaRDI QIDQ899313FDOQ899313
Authors: Miriam Di Ianni, Giorgio Gambosi, Gianluca Rossi, Paola Vocca 
Publication date: 28 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.034
Recommendations
- A general view on computing communities
- The maximum community partition problem in networks
- Toward optimal community detection: from trees to general weighted networks
- Community detection by modularity maximization using GRASP with path relinking
- Community detection with the weighted parsimony criterion
Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Complex networks: structure and dynamics
- Community structure in social and biological networks
- Graph clustering
- Networks, crowds and markets. Reasoning about a highly connected world.
- Network analysis. Methodological foundations.
- Graph Clustering and Minimum Cut Trees
- Algorithmic approach to the satisfactory graph partitioning problem
- The satisfactory partition problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
- Assessing the quality of multilevel graph clustering
- Algorithms and Computation
- Distributed Community Detection in Dynamic Graphs
- Detecting the Structure of Social Networks Using (α,β)-Communities
Cited In (7)
- Complete graph model for community detection
- New insight into 2-community structures in graphs with applications in social networks
- A general view on computing communities
- A robust multi-view clustering method for community detection combining link and content information
- Detecting communities is hard (and counting them is even harder)
- The maximum community partition problem in networks
- A note on the satisfactory partition problem: constant size requirement
This page was built for publication: Min-max communities in graphs: complexity and computational properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899313)
