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.MFCS.2021.82
URN: urn:nbn:de:0030-drops-145224
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/14522/
Go to the corresponding LIPIcs Volume Portal

Paesani, Giacomo ; Paulusma, Daniël ; Rzążewski, Paweł

Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs

pdf-format:
LIPIcs-MFCS-2021-82.pdf (1 MB)

Abstract

We prove new complexity results for Feedback Vertex Set and Even Cycle Transversal on H-free graphs, that is, graphs that do not contain some fixed graph H as an induced subgraph. In particular, we prove that both problems are polynomial-time solvable for sP₃-free graphs for every integer s ≥ 1; here, the graph sP₃ denotes the disjoint union of s paths on three vertices. Our results show that both problems exhibit the same behaviour on H-free graphs (subject to some open cases). This is in part explained by a new general algorithm we design for finding in a graph G a largest induced subgraph whose blocks belong to some finite class C of graphs. We also compare our results with the state-of-the-art results for the Odd Cycle Transversal problem, which is known to behave differently on H-free graphs.

BibTeX - Entry

@InProceedings{paesani_et_al:LIPIcs.MFCS.2021.82,
  author =	{Paesani, Giacomo and Paulusma, Dani\"{e}l and Rz\k{a}\.{z}ewski, Pawe{\l}},
  title =	{{Feedback Vertex Set and Even Cycle Transversal for H-Free Graphs: Finding Large Block Graphs}},
  booktitle =	{46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
  pages =	{82:1--82:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-201-3},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{202},
  editor =	{Bonchi, Filippo and Puglisi, Simon J.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/14522},
  URN =		{urn:nbn:de:0030-drops-145224},
  doi =		{10.4230/LIPIcs.MFCS.2021.82},
  annote =	{Keywords: Feedback vertex set, even cycle transversal, odd cactus, forest, block}
}

Keywords: Feedback vertex set, even cycle transversal, odd cactus, forest, block
Collection: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)
Issue Date: 2021
Date of publication: 18.08.2021

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