Fixed parameterized algorithms for generalized feedback vertex set problems

DOI10.1016/j.tcs.2023.113798OpenAlexW4323276515MaRDI QIDQ2693637

Gregory Gutin, Bin Sheng

Publication date: 24 March 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113798

zbMATH Keywords

feedback vertex setkernelizationfixed parameterized algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• 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
• Parametrized complexity theory.
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Subset Feedback Vertex Set Is Fixed-Parameter Tractable
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel
• Kernelization
• 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
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen

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