Fixed parameterized algorithms for generalized feedback vertex set problems

DOI10.1016/J.TCS.2023.113798MaRDI QIDQ2693637zbMATH OpenOpenAlexFDO

Authors Bin Sheng, G. Gutin

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

kernelizationfeedback vertex setfixed parameterized algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Generalized pseudoforest deletion: algorithms and uniform kernel
• Generalized pseudoforest deletion: algorithms and uniform kernel
• Faster parameterized algorithm for r-pseudoforest deletion
• A faster parameterized algorithm for pseudoforest deletion
• A faster parameterized algorithm for pseudoforest deletion

Cites work

• scientific article; zbMATH DE number 571325 (Why is no real title available?)
• scientific article; zbMATH DE number 1179517 (Why is no real title available?)
• scientific article; zbMATH DE number 1467487 (Why is no real title available?)
• scientific article; zbMATH DE number 7650230 (Why is no real title available?)
• A faster parameterized algorithm for pseudoforest deletion
• An improved FPT algorithm for almost forest deletion problem
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• Detecting Feedback Vertex Sets of Size k in O*(2.7^k) Time
• Directed subset feedback vertex set is fixed-parameter tractable
• Fundamentals of parameterized complexity
• Generalized pseudoforest deletion: algorithms and uniform kernel
• Improved algorithms for feedback vertex set problems
• Kernelization. Theory of parameterized preprocessing
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• On feedback vertex set: new measure and new structures
• Parameterized algorithms
• Parametrized complexity theory.
• Reducibility among combinatorial problems
• Smaller parameters for vertex cover kernelization
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

Cited in

(6)

• scientific article; zbMATH DE number 7286685 (Why is no real title available?)
• A polyhedral approach to the feedback vertex set problem
• Deterministic Algorithms for the Independent Feedback Vertex Set Problem
• Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Faster parameterized algorithm for r-pseudoforest deletion

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693637)