A faster parameterized algorithm for pseudoforest deletion

Hans L. Bodlaender, Hirotaka Ono, Yota Otachi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

A pseudoforest is a graph where each connected component contains at most one cycle, or alternatively, a graph that can be turned into a forest by removing at most one edge from each connected component. In this paper, we show that the following problem can be solved in O(3knkO(1)) time: given a graph G and an integer k, can we delete at most k vertices from G such that we obtain a pseudoforest? The result improves upon an earlier result by Philip et al. [MFCS 2015] who gave a (nonlinear) 7.56knO(1)-time algorithm both in the exponential factor depending on k as well as in the polynomial factor depending on n.

Original languageEnglish
Title of host publication11th International Symposium on Parameterized and Exact Computation, IPEC 2016
EditorsJiong Guo, Danny Hermelin
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770231
DOIs
Publication statusPublished - Feb 1 2017
Event11th International Symposium on Parameterized and Exact Computation, IPEC 2016 - Aarhus, Denmark
Duration: Aug 24 2016Aug 26 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume63
ISSN (Print)1868-8969

Other

Other11th International Symposium on Parameterized and Exact Computation, IPEC 2016
CountryDenmark
CityAarhus
Period8/24/168/26/16

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'A faster parameterized algorithm for pseudoforest deletion'. Together they form a unique fingerprint.

Cite this