Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Marx, Dániel https://www.dagstuhl.de/lipics License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-129373
URL:

Chordless Cycle Packing Is Fixed-Parameter Tractable

pdf-format:


Abstract

A chordless cycle or hole in a graph G is an induced cycle of length at least 4. In the Hole Packing problem, a graph G and an integer k is given, and the task is to find (if exists) a set of k pairwise vertex-disjoint chordless cycles. Our main result is showing that Hole Packing is fixed-parameter tractable (FPT), that is, can be solved in time f(k)n^O(1) for some function f depending only on k.

BibTeX - Entry

@InProceedings{marx:LIPIcs:2020:12937,
  author =	{D{\'a}niel Marx},
  title =	{{Chordless Cycle Packing Is Fixed-Parameter Tractable}},
  booktitle =	{28th Annual European Symposium on Algorithms (ESA 2020)},
  pages =	{71:1--71:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-162-7},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{173},
  editor =	{Fabrizio Grandoni and Grzegorz Herman and Peter Sanders},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12937},
  URN =		{urn:nbn:de:0030-drops-129373},
  doi =		{10.4230/LIPIcs.ESA.2020.71},
  annote =	{Keywords: chordal graphs, packing, fixed-parameter tractability}
}

Keywords: chordal graphs, packing, fixed-parameter tractability
Seminar: 28th Annual European Symposium on Algorithms (ESA 2020)
Issue date: 2020
Date of publication: 26.08.2020


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