Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel

DOI10.1007/978-3-662-48054-0_43zbMath1400.05242OpenAlexW1933586750MaRDI QIDQ2946421

Saket Saurabh, Ashutosh Rai, Geevarghese Philip

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

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

Related Items (7)

Minimizing Maximum Unmet Demand by Transportations Between Adjacent Nodes Characterized by Supplies and Demands ⋮ A faster parameterized algorithm for pseudoforest deletion ⋮ Transportation Problem Allowing Sending and Bringing Back ⋮ An improved FPT algorithm for almost forest deletion problem ⋮ Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs ⋮ An approximation algorithm for the \(l\)-pseudoforest deletion problem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• The node-deletion problem for hereditary properties is NP-complete
• Faster deterministic \textsc{Feedback Vertex Set}
• Bivariate Complexity Analysis of Almost Forest Deletion
• Uniform Kernelization Complexity of Hitting Forbidden Minors
• Solving d-SAT via Backdoors to Small Treewidth
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen

This page was built for publication: Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel