FPT algorithms for generalized feedback vertex set problems

DOI10.1007/978-3-030-59267-7_34OpenAlexW3109765819MaRDI QIDQ2110739

Bin Sheng

Publication date: 22 December 2022

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

zbMATH Keywords

kernelizationFPTgeneralized feedback vertex set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On feedback vertex set: new measure and new structures
• 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
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Reducibility among Combinatorial Problems
• Smaller Parameters for Vertex Cover Kernelization
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Parameterized Algorithms

This page was built for publication: FPT algorithms for generalized feedback vertex set problems