A faster parameterized algorithm for pseudoforest deletion

Hans L. Bodlaender, Hirotaka Ono, Yota Otachi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

6 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトル11th International Symposium on Parameterized and Exact Computation, IPEC 2016
編集者Jiong Guo, Danny Hermelin
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959770231
DOI
出版ステータス出版済み - 2 1 2017
イベント11th International Symposium on Parameterized and Exact Computation, IPEC 2016 - Aarhus, デンマーク
継続期間: 8 24 20168 26 2016

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
63
ISSN(印刷版)1868-8969

その他

その他11th International Symposium on Parameterized and Exact Computation, IPEC 2016
Countryデンマーク
CityAarhus
Period8/24/168/26/16

All Science Journal Classification (ASJC) codes

  • Software

フィンガープリント 「A faster parameterized algorithm for pseudoforest deletion」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル