Min-max communities in graphs: complexity and computational properties

DOI10.1016/j.tcs.2015.11.034zbMath1333.05237OpenAlexW2474071255MaRDI QIDQ899313

Miriam Di Ianni, Giorgio Gambosi, Paola Vocca, Gianluca Rossi

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

zbMATH Keywords

graph partitioningcommunity discovery

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A robust multi-view clustering method for community detection combining link and content information ⋮ A note on the satisfactory partition problem: constant size requirement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• Assessing the quality of multilevel graph clustering
• Algorithmic approach to the satisfactory graph partitioning problem
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• Network analysis. Methodological foundations.
• Complex networks: structure and dynamics
• The satisfactory partition problem
• Distributed Community Detection in Dynamic Graphs
• Detecting the Structure of Social Networks Using (α,β)-Communities
• Community structure in social and biological networks
• Graph Clustering and Minimum Cut Trees
• Algorithms and Computation

This page was built for publication: Min-max communities in graphs: complexity and computational properties