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

Fingerprint

Polynomials

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Bodlaender, H. L., Ono, H., & Otachi, Y. (2017). A faster parameterized algorithm for pseudoforest deletion. In J. Guo, & D. Hermelin (Eds.), 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 [7] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 63). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2016.7

A faster parameterized algorithm for pseudoforest deletion. / Bodlaender, Hans L.; Ono, Hirotaka; Otachi, Yota.

11th International Symposium on Parameterized and Exact Computation, IPEC 2016. ed. / Jiong Guo; Danny Hermelin. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. 7 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 63).

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

Bodlaender, HL, Ono, H & Otachi, Y 2017, A faster parameterized algorithm for pseudoforest deletion. in J Guo & D Hermelin (eds), 11th International Symposium on Parameterized and Exact Computation, IPEC 2016., 7, Leibniz International Proceedings in Informatics, LIPIcs, vol. 63, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, Aarhus, Denmark, 8/24/16. https://doi.org/10.4230/LIPIcs.IPEC.2016.7
Bodlaender HL, Ono H, Otachi Y. A faster parameterized algorithm for pseudoforest deletion. In Guo J, Hermelin D, editors, 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2017. 7. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.IPEC.2016.7
Bodlaender, Hans L. ; Ono, Hirotaka ; Otachi, Yota. / A faster parameterized algorithm for pseudoforest deletion. 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. editor / Jiong Guo ; Danny Hermelin. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{83717d16bc82421d8b72679e05882969,
title = "A faster parameterized algorithm for pseudoforest deletion",
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.",
author = "Bodlaender, {Hans L.} and Hirotaka Ono and Yota Otachi",
year = "2017",
month = "2",
day = "1",
doi = "10.4230/LIPIcs.IPEC.2016.7",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Jiong Guo and Danny Hermelin",
booktitle = "11th International Symposium on Parameterized and Exact Computation, IPEC 2016",

}

TY - GEN

T1 - A faster parameterized algorithm for pseudoforest deletion

AU - Bodlaender, Hans L.

AU - Ono, Hirotaka

AU - Otachi, Yota

PY - 2017/2/1

Y1 - 2017/2/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85014711805&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85014711805&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.IPEC.2016.7

DO - 10.4230/LIPIcs.IPEC.2016.7

M3 - Conference contribution

AN - SCOPUS:85014711805

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 11th International Symposium on Parameterized and Exact Computation, IPEC 2016

A2 - Guo, Jiong

A2 - Hermelin, Danny

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -