\( \gamma \)-clustering problems: classical and parametrized complexity
type: Item
instance of: scholarly article
title: \( \gamma \)-clustering problems: classical and parametrized complexity
author: Julien Baste
author: Antoine Castillon
author: Clarisse Dhaenens
author: Mohammed Haddad
author: Hamida Seba
published in: Theoretical Computer Science
publication date: 2024-10-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7922974
MaRDI profile type: Publication
cites work: Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem
cites work: Cluster editing: kernelization based on edge cuts
cites work: Clustering with qualitative information
cites work: Complexity Results for Multiprocessor Scheduling under Resource Constraints
cites work: Some simplified NP-complete graph problems
cites work: Community structure in social and biological networks
cites work: Q4437501
cites work: A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
cites work: Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
cites work: Multivariate algorithmics for finding cohesive subnetworks
cites work: Clustering with local restrictions
cites work: On the parameterized complexity of s-club cluster deletion problems
cites work: On the maximum quasi-clique problem
cites work: Cluster graph modification problems
cites work: Another look at the degree constrained subgraph problem
cites work: An Efficient Algorithm for Enumerating Pseudo Cliques
DOI: 10.1016/J.TCS.2024.114784
description: scientific article; zbMATH DE number 7922974