License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2015.343
URN: urn:nbn:de:0030-drops-55950
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5595/
Go to the corresponding LIPIcs Volume Portal

Hermelin, Danny ; Kaspi, Moshe ; Komusiewicz, Christian ; Navon, Barak

Parameterized Complexity of Critical Node Cuts

pdf-format:
32.pdf (0.5 MB)

Abstract

We consider the following graph cut problem called Critical Node Cut (CNC): Given a graph G on n vertices, and two positive integers k and x, determine whether G has a set of k vertices whose removal leaves G with at most x connected pairs of vertices. We analyze this problem in the framework of parameterized complexity. That is, we are interested in whether or not this problem is solvable in f(kappa) * n^{O(1)} time (i.e., whether or not it is fixed-parameter tractable), for various natural parameters kappa. We consider four such parameters:
- The size k of the required cut.
- The upper bound x on the number of remaining connected pairs.
- The lower bound y on the number of connected pairs to be removed.
- The treewidth w of G.

We determine whether or not CNC is fixed-parameter tractable for each of these parameters. We determine this also for all possible aggregations of these four parameters, apart from w+k. Moreover, we also determine whether or not CNC admits a polynomial kernel for all these parameterizations. That is, whether or not there is an algorithm that reduces each instance of CNC in polynomial time to an equivalent instance of size kappa^{O(1)}, where kappa is the given parameter.

BibTeX - Entry

@InProceedings{hermelin_et_al:LIPIcs:2015:5595,
  author =	{Danny Hermelin and Moshe Kaspi and Christian Komusiewicz and Barak Navon},
  title =	{{Parameterized Complexity of Critical Node Cuts}},
  booktitle =	{10th International Symposium on Parameterized and Exact Computation (IPEC 2015)},
  pages =	{343--354},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-92-7},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{43},
  editor =	{Thore Husfeldt and Iyad Kanj},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5595},
  URN =		{urn:nbn:de:0030-drops-55950},
  doi =		{10.4230/LIPIcs.IPEC.2015.343},
  annote =	{Keywords: graph cut problem, NP-hard problem, treewidth}
}

Keywords: graph cut problem, NP-hard problem, treewidth
Collection: 10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Issue Date: 2015
Date of publication: 19.11.2015

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