Deterministic Algorithms for the Independent Feedback Vertex Set Problem
From MaRDI portal
Publication:2946071
DOI10.1007/978-3-319-19315-1_31zbMATH Open1401.68127OpenAlexW2293112721MaRDI QIDQ2946071FDOQ2946071
Authors: 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
Recommendations
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
- An improved parameterized algorithm for the independent feedback vertex set problem
- On parameterized independent feedback vertex set
- On parameterized independent feedback vertex set
- Approximability of the independent feedback vertex set problem for bipartite graphs
- Approximability of the independent feedback vertex set problem for bipartite graphs
- A fixed-parameter algorithm for the directed feedback vertex set problem
- Fixed parameterized algorithms for generalized feedback vertex set problems
- Parameterized and Exact Computation
- Improved Algorithms for the Feedback Vertex Set Problems
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Graph Classes: A Survey
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Algorithmic meta-theorems for restrictions of treewidth
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- On parameterized independent feedback vertex set
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up
- Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
- Title not available (Why is that?)
- On feedback vertex sets and nonseparating independent sets in cubic graphs
- Linear-time modular decomposition of directed graphs
- A \(c^k n\) 5-approximation algorithm for treewidth
- An improved parameterized algorithm for the independent feedback vertex set problem
- Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm
Cited In (14)
- Recognizing Graphs Close to Bipartite Graphs
- Approximability of the independent feedback vertex set problem for bipartite graphs
- An improved FPT algorithm for independent feedback vertex set
- An improved FPT algorithm for independent feedback vertex set
- Independent feedback vertex set for \(P_5\)-free graphs
- Feedback vertex set on planar graphs
- Independent feedback vertex sets for graphs of bounded diameter
- A feedback vertex set of 2-degenerate graphs
- Efficient algorithm for minimum feedback vertex set problem on trapezoid graphs
- Independent Feedback Vertex Set for P_5-free Graphs
- An improved parameterized algorithm for the independent feedback vertex set problem
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Minimum feedback vertex set and acyclic coloring.
- Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set
This page was built for publication: Deterministic Algorithms for the Independent Feedback Vertex Set Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946071)
