Min-max communities in graphs: complexity and computational properties
type: Item
instance of: scholarly article
title: Min-max communities in graphs: complexity and computational properties
zbMATH Open document ID: 1333.05237
author: Miriam Di Ianni
author: Giorgio Gambosi
author: Gianluca Rossi
author: Paola Vocca
published in: Theoretical Computer Science
publication date: 2015-12-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6524283
zbMATH Keywords: community discovery
zbMATH Keywords: graph partitioning
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.11.034
OpenAlex ID: W2474071255
cites work: Algorithms and Computation
cites work: The satisfactory partition problem
cites work: Complex networks: structure and dynamics
cites work: Network analysis. Methodological foundations.
cites work: Distributed Community Detection in Dynamic Graphs
cites work: Q4931752
cites work: Graph Clustering and Minimum Cut Trees
cites work: Algorithmic approach to the satisfactory graph partitioning problem
cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
cites work: Q4820779
cites work: Community structure in social and biological networks
cites work: Detecting the Structure of Social Networks Using (α,β)-Communities
cites work: Assessing the quality of multilevel graph clustering
cites work: Graph clustering
cites work: Q4405794
cites work: Q4715286
DOI: 10.1016/J.TCS.2015.11.034
description: scientific article; zbMATH DE number 6524283