A note on the satisfactory partition problem: constant size requirement

DOI10.1016/j.ipl.2022.106292OpenAlexW4281773077MaRDI QIDQ2094373

Miriam Di Ianni, Giancarlo Palumbo, Felice Ciccarelli

Publication date: 28 October 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106292

zbMATH Keywords

computational complexitygraph partitioninggraph algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph clustering
• The balanced satisfactory partition problem
• Min-max communities in graphs: complexity and computational properties
• Optimization, approximation, and complexity classes
• Algorithmic approach to the satisfactory graph partitioning problem
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
• Network analysis. Methodological foundations.
• On the problem of finding disjoint cycles and dicycles in a digraph
• The satisfactory partition problem
• Community structure in social and biological networks
• Graph Clustering and Minimum Cut Trees
• Algorithms and Computation
• Parameterized complexity of satisfactory partition problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the satisfactory partition problem: constant size requirement