Bivariate complexity analysis of \textsc{Almost Forest Deletion}

DOI10.1007/978-3-319-21398-9_11MaRDI QIDQ3196379zbMATH OpenOpenAlexFDO

Authors Ashutosh Rai, Saket Saurabh

Publication date 29 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-21398-9_11

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

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

Cites work

• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
• Faster deterministic \textsc{Feedback Vertex Set}
• Finding odd cycle transversals.
• Fundamentals of parameterized complexity
• Hitting forbidden minors: approximation and kernelization
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Implicit branching and parameterized partial cover problems
• Improved bounds on the planar branchwidth with respect to the largest grid minor size
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
• Parameterized and Exact Computation
• Parametrized complexity theory.
• Quickly excluding a planar graph
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Subexponential algorithms for partial cover problems
• The complexity ecology of parameters: An illustration using bounded max leaf number
• The node-deletion problem for hereditary properties is NP-complete
• Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
• Treewidth. Computations and approximations

Cited in

(4)

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

This page was built for publication: Bivariate complexity analysis of \textsc{Almost Forest Deletion}

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