Deterministic Algorithms for the Independent Feedback Vertex Set Problem

DOI10.1007/978-3-319-19315-1_31zbMath1401.68127OpenAlexW2293112721MaRDI QIDQ2946071

Yuma Tamura, Takehiro Ito, Xiao Zhou

Publication date: 15 September 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-19315-1_31

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Independent feedback vertex set for \(P_5\)-free graphs ⋮ Recognizing Graphs Close to Bipartite Graphs ⋮ Independent Feedback Vertex Set for P_5-free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On parameterized independent feedback vertex set
• Algorithmic meta-theorems for restrictions of treewidth
• Linear-time modular decomposition of directed graphs
• An improved parameterized algorithm for the independent feedback vertex set problem
• A $c^k n$ 5-Approximation Algorithm for Treewidth
• Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
• Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
• Graph minors. II. Algorithmic aspects of tree-width
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Graph Classes: A Survey
• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

This page was built for publication: Deterministic Algorithms for the Independent Feedback Vertex Set Problem