A note on the satisfactory partition problem: constant size requirement
type: Item
instance of: scholarly article
title: A note on the satisfactory partition problem: constant size requirement
author: Felice Ciccarelli
author: Miriam Di Ianni
author: Giancarlo Palumbo
published in: Information Processing Letters
publication date: 2022-10-28T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7609044
zbMATH Keywords: graph partitioning
zbMATH Keywords: graph algorithms
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2022.106292
OpenAlex ID: W4281773077
cites work: On the problem of finding disjoint cycles and dicycles in a digraph
cites work: Algorithms and Computation
cites work: The satisfactory partition problem
cites work: Network analysis. Methodological foundations.
cites work: Min-max communities in graphs: complexity and computational properties
cites work: Q4931752
cites work: Graph Clustering and Minimum Cut Trees
cites work: Parameterized complexity of satisfactory partition problem
cites work: The balanced satisfactory partition problem
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: Q5530472
cites work: Q4273847
cites work: Optimization, approximation, and complexity classes
cites work: Graph clustering
cites work: Q4405794
cites work: Q4715286
DOI: 10.1016/J.IPL.2022.106292
description: scientific article; zbMATH DE number 7609044