Generalized pseudoforest deletion: algorithms and uniform kernel

DOI10.1007/978-3-662-48054-0_43MaRDI QIDQ2946421zbMATH OpenOpenAlexFDO

Authors Geevarghese Philip, Ashutosh Rai, Saket Saurabh

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48054-0_43

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40)

Recommendations

• Generalized pseudoforest deletion: algorithms and uniform kernel
• A faster parameterized algorithm for pseudoforest deletion
• An approximation algorithm for the \(l\)-pseudoforest deletion problem
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• A faster parameterized algorithm for pseudoforest deletion

Cites work

• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• Faster deterministic \textsc{Feedback Vertex Set}
• Fundamentals of parameterized complexity
• Hitting forbidden minors: approximation and kernelization
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• Solving d-SAT via Backdoors to Small Treewidth
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• The node-deletion problem for hereditary properties is NP-complete

Cited in

(17)

• Generalized pseudoforest deletion: algorithms and uniform kernel
• Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• An improved FPT algorithm for almost forest deletion problem
• Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
• Simultaneous feedback vertex set: a parameterized perspective
• Parameterized orientable deletion
• Simultaneous feedback vertex set: a parameterized perspective
• Constant factor approximation algorithm for l-pseudoforest deletion problem
• Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands
• Fixed parameterized algorithms for generalized feedback vertex set problems
• Transportation Problem Allowing Sending and Bringing Back
• An approximation algorithm for the \(l\)-pseudoforest deletion problem
• Bivariate complexity analysis of \textsc{Almost Forest Deletion}
• A faster parameterized algorithm for pseudoforest deletion
• A faster parameterized algorithm for pseudoforest deletion
• Faster parameterized algorithm for r-pseudoforest deletion

This page was built for publication: Generalized pseudoforest deletion: algorithms and uniform kernel

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