Improved FPT Algorithms for Deletion to Forest-like Structures

The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterized Complexity. In this problem, given an undirected graph $G$ and a non-negative integer $k$, the objective is to test whether there exists a subset $S\subseteq V(G)$ of size at most $k$ such that $G-S$ is a forest. After a long line of improvement, recently, Li and Nederlof [SODA, 2020] designed a randomized algorithm for the problem running in time $\mathcal{O}^{\star}(2.7^k)$. In the Parameterized Complexity literature, several problems around Feedback Vertex Set have been studied. Some of these include Independent Feedback Vertex Set (where the set $S$ should be an independent set in $G$), Almost Forest Deletion and Pseudoforest Deletion. In Pseudoforest Deletion, each connected component in $G-S$ has at most one cycle in it. However, in Almost Forest Deletion, the input is a graph $G$ and non-negative integers $k,\ell \in \mathbb{N}$, and the objective is to test whether there exists a vertex subset $S$ of size at most $k$, such that $G-S$ is $\ell$ edges away from a forest. In this paper, using the methodology of Li and Nederlof [SODA, 2020], we obtain the current fastest algorithms for all these problems. In particular we obtain following randomized algorithms. 1) Independent Feedback Vertex Set can be solved in time $\mathcal{O}^{\star}(2.7^k)$. 2) Pseudo Forest Deletion can be solved in time $\mathcal{O}^{\star}(2.85^k)$. 3) Almost Forest Deletion can be solved in $\mathcal{O}^{\star}(\min\{2.85^k \cdot 8.54^\ell,2.7^k \cdot 36.61^\ell,3^k \cdot 1.78^\ell\})$.

[1]  Yota Otachi,et al.  A Faster Parameterized Algorithm for Pseudoforest Deletion , 2016, IPEC.

[2]  Yixin Cao,et al.  A Naive Algorithm for Feedback Vertex Set , 2017, SOSA.

[3]  Marcin Pilipczuk,et al.  An Improved FPT Algorithm for Independent Feedback Vertex Set , 2018, Theory of Computing Systems.

[4]  G DowneyRod,et al.  Fixed-Parameter Tractability and Completeness I , 1995 .

[5]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2008, J. Comput. Syst. Sci..

[6]  Jianer Chen,et al.  On Feedback Vertex Set: New Measure and New Structures , 2010, Algorithmica.

[7]  Hans L. Bodlaender,et al.  On Disjoint Cycles , 1991, Int. J. Found. Comput. Sci..

[8]  Marcin Pilipczuk,et al.  An Improved FPT Algorithm for Independent Feedback Vertex Set , 2020, Theory of Computing Systems.

[9]  Jianer Chen,et al.  Improved algorithms for feedback vertex set problems , 2007, J. Comput. Syst. Sci..

[10]  Saket Saurabh,et al.  Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set , 2002, ISAAC.

[11]  Yoichi Iwata,et al.  Improved Analysis of Highest-Degree Branching for Feedback Vertex Set , 2019, Algorithmica.

[12]  Saket Saurabh,et al.  Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set , 2017, IPEC.

[13]  Reuven Bar-Yehuda,et al.  Randomized Algorithms for the Loop Cutset Problem , 2000, J. Artif. Intell. Res..

[14]  Jason Li,et al.  Detecting Feedback Vertex Sets of Size $k$ in $O^\star(2.7^k)$ Time , 2019, SODA 2019.

[15]  Geevarghese Philip,et al.  FPT algorithms for Connected Feedback Vertex Set , 2009, Journal of Combinatorial Optimization.

[16]  François Le Gall,et al.  Powers of tensors and fast matrix multiplication , 2014, ISSAC.

[17]  Saket Saurabh,et al.  Linear Time Parameterized Algorithms for Subset Feedback Vertex Set , 2018, ACM Trans. Algorithms.

[18]  Luca Manfrin The undirected Feedback Vertex Set problem , 2018 .

[19]  Rolf Niedermeier,et al.  Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization , 2006, J. Comput. Syst. Sci..

[20]  Yoichi Iwata,et al.  0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms , 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[21]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[22]  Junjie Ye,et al.  A Note on Finding Dual Feedback Vertex Set , 2015, ArXiv.

[23]  Michael R. Fellows,et al.  An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem , 2005, Theory of Computing Systems.

[24]  Saket Saurabh,et al.  Bivariate complexity analysis of Almost Forest Deletion , 2018, Theor. Comput. Sci..

[25]  Geevarghese Philip,et al.  Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel , 2015, MFCS.

[26]  Bin Fu,et al.  An improved FPT algorithm for Almost Forest Deletion problem , 2018, Inf. Process. Lett..

[27]  Stefan Richter,et al.  A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms , 2008, SIAM J. Discret. Math..

[28]  Panos M. Pardalos,et al.  Feedback Set Problems , 2009, Encyclopedia of Optimization.

[29]  Saket Saurabh,et al.  Simultaneous Feedback Vertex Set: A Parameterized Perspective , 2015, TOCT.

[30]  Michal Pilipczuk,et al.  Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[31]  Ken-ichi Kawarabayashi,et al.  Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem , 2012, J. Comb. Theory, Ser. B.

[32]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[33]  Marcin Pilipczuk,et al.  Faster deterministic Feedback Vertex Set , 2013, Inf. Process. Lett..

[34]  Jason Li,et al.  Detecting Feedback Vertex Sets of Size k in O⋆ (2.7k) Time , 2020, SODA.

[35]  Geevarghese Philip,et al.  On Parameterized Independent Feedback Vertex Set , 2011, Theor. Comput. Sci..