γ-clustering problems: Classical and parametrized complexity - École Centrale de Lyon
Journal Articles Theoretical Computer Science Year : 2024

γ-clustering problems: Classical and parametrized complexity

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.
Fichier principal
Vignette du fichier
version_soumise_quasi-cluster.pdf (496.7 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04693347 , version 1 (13-09-2024)

Identifiers

Cite

Julien Baste, Antoine Castillon, Clarisse Dhaenens, Mohammed Haddad, Hamida Seba. γ-clustering problems: Classical and parametrized complexity. Theoretical Computer Science, 2024, 1018, pp.114784. ⟨10.1016/j.tcs.2024.114784⟩. ⟨hal-04693347⟩
6 View
0 Download

Altmetric

Share

More