Improved FPT Algorithms for Deletion to Forest-Like Structures.

DOI10.4230/lipics.isaac.2020.34arXiv2009.13949OpenAlexW3113761709MaRDI QIDQ6065438

Vraj Patel, Kishen N. Gowda, Unnamed Author, Saket Saurabh, Fahad Panolan

Publication date: 14 November 2023

Full work available at URL: https://arxiv.org/abs/2009.13949

zbMATH Keywords

treewidthparameterized complexitypseudoforestindependent feedback vertex setalmost forestcut and count

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

An improved deterministic parameterized algorithm for cactus vertex deletion ⋮ Faster deterministic algorithm for cactus vertex deletion

Cites Work

• Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
• On feedback vertex set: new measure and new structures
• On parameterized independent feedback vertex set
• FPT algorithms for connected feedback vertex set
• Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
• Improved algorithms for feedback vertex set problems
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• A faster parameterized algorithm for pseudoforest deletion
• An improved FPT algorithm for almost forest deletion problem
• Faster deterministic \textsc{Feedback Vertex Set}
• An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
• Half-integrality, LP-branching, and FPT Algorithms
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Linear Time Parameterized Algorithms for S <scp>ubset</scp> F <scp>eedback</scp> V <scp>ertex</scp> S <scp>et</scp>
• Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
• Simultaneous Feedback Vertex Set
• A naive algorithm for feedback vertex set
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• An improved FPT algorithm for independent feedback vertex set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved FPT Algorithms for Deletion to Forest-Like Structures.