License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2021.49
URN: urn:nbn:de:0030-drops-136945
URL: https://drops.dagstuhl.de/opus/volltexte/2021/13694/
Go to the corresponding LIPIcs Volume Portal

Li, Shaohua ; Pilipczuk, Marcin ; Sorge, Manuel

Cluster Editing Parameterized Above Modification-Disjoint Pā‚ƒ-Packings

pdf-format:
LIPIcs-STACS-2021-49.pdf (1 MB)

Abstract

Given a graph G = (V,E) and an integer k, the Cluster Editing problem asks whether we can transform G into a union of vertex-disjoint cliques by at most k modifications (edge deletions or insertions). In this paper, we study the following variant of Cluster Editing. We are given a graph G = (V,E), a packing ā„‹ of modification-disjoint induced Pā‚ƒs (no pair of Pā‚ƒs in H share an edge or non-edge) and an integer š“. The task is to decide whether G can be transformed into a union of vertex-disjoint cliques by at most š“+|H| modifications (edge deletions or insertions). We show that this problem is NP-hard even when š“ = 0 (in which case the problem asks to turn G into a disjoint union of cliques by performing exactly one edge deletion or insertion per element of H) and when each vertex is in at most 23 Pā‚ƒs of the packing. This answers negatively a question of van Bevern, Froese, and Komusiewicz (CSR 2016, ToCS 2018), repeated by C. Komusiewicz at Shonan meeting no. 144 in March 2019. We then initiate the study to find the largest integer c such that the problem remains tractable when restricting to packings such that each vertex is in at most c packed Pā‚ƒs. Van Bevern et al. showed that the case c = 1 is fixed-parameter tractable with respect to š“ and we show that the case c = 2 is solvable in |V|^{2š“ + O(1)} time.

BibTeX - Entry

@InProceedings{li_et_al:LIPIcs.STACS.2021.49,
  author =	{Li, Shaohua and Pilipczuk, Marcin and Sorge, Manuel},
  title =	{{Cluster Editing Parameterized Above Modification-Disjoint Pā‚ƒ-Packings}},
  booktitle =	{38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)},
  pages =	{49:1--49:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-180-1},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{187},
  editor =	{Bl\"{a}ser, Markus and Monmege, Benjamin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/13694},
  URN =		{urn:nbn:de:0030-drops-136945},
  doi =		{10.4230/LIPIcs.STACS.2021.49},
  annote =	{Keywords: Graph algorithms, fixed-parameter tractability, parameterized complexity}
}

Keywords: Graph algorithms, fixed-parameter tractability, parameterized complexity
Collection: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)
Issue Date: 2021
Date of publication: 10.03.2021

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI