γ-clustering problems: Classical and parametrized complexity
Year: 2024
Type: article
Abstract: We introduce the γ -clustering problems, which are variants of the well-known Cluster Editing/Deletion/Completion problems, and defined as: given a graph G , how many edges must be edited in G , deleted from G , or added to G in order to have a disjoint union of γ -quasi-cliques. We provide here the complete complexity classification of these problems along with FPT algorithms parameterized by the number of modifications, for the NP -complete problems. We also study here a variant of these problems where the number of final clusters is a fixed constant, obtaining mostly the same results regarding classical and parameterized complexity.
Source: Theoretical Computer Science
Institutions: Centre National de la Recherche Scientifique, Université de Lille, Centre de Recherche en Informatique, Signal et Automatique de Lille, Centrale Lille Institut, Lyon 1 Université, Laboratoire d'Informatique en Images et Systèmes d'Information, Université Lille 1, Institut National des Sciences Appliquées de Lyon
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $2,800
Funder: Agence Nationale de la Recherche
OpenAlex ID: W4401742453