Faster fixed parameter tractable algorithms for finding feedback vertex sets
From MaRDI portal
Recommendations
Cited in
(55)- Parameterizing above or below guaranteed values
- Kernels for deletion to classes of acyclic digraphs
- New formulae for the bipartite vertex frustration and decycling number of graphs
- Faster deterministic \textsc{Feedback Vertex Set}
- On the complexity of singly connected vertex deletion
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
- Local search is a PTAS for feedback vertex set in minor-free graphs
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Mim-width. II. The feedback vertex set problem
- A simple local search gives a PTAS for the Feedback Vertex Set problem in minor-free graphs
- Parameterised algorithms for deletion to classes of DAGs
- An improved parameterized algorithm for the independent feedback vertex set problem
- An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
- Parameterized complexity of fair feedback vertex set problem
- Towards a polynomial kernel for directed feedback vertex set
- Backdoors to satisfaction
- A quartic kernel for pathwidth-one vertex deletion
- A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
- scientific article; zbMATH DE number 3848625 (Why is no real title available?)
- Linear time parameterized algorithms for subset feedback vertex set
- On feedback vertex set new measure and new structures
- Improved Algorithms for the Feedback Vertex Set Problems
- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
- scientific article; zbMATH DE number 3972888 (Why is no real title available?)
- scientific article; zbMATH DE number 4024812 (Why is no real title available?)
- scientific article; zbMATH DE number 1979503 (Why is no real title available?)
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
- Enumerating minimal subset feedback vertex sets
- Efficient algorithm for minimum feedback vertex set problem on trapezoid graphs
- On feedback vertex set: new measure and new structures
- On the Complexity of Singly Connected Vertex Deletion
- Towards a polynomial kernel for directed feedback vertex set
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- Detecting Feedback Vertex Sets of Size k in O*(2.7k) Time
- Feedback vertex set in mixed graphs
- Packing cycles faster than Erdős-Pósa
- A naive algorithm for feedback vertex set
- Parameterized and Exact Computation
- Algorithms and Data Structures
- Minimal feedback vertex sets in directed split‐stars
- scientific article; zbMATH DE number 970357 (Why is no real title available?)
- Computing and Combinatorics
- Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
- A parameterized algorithm for subset feedback vertex set in tournaments
- Extremal properties of the bipartite vertex frustration of graphs
- FPT algorithms for connected feedback vertex set
- Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
- A polynomial kernel for deletion to the scattered class of cliques and trees
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- Subset feedback vertex set parameterized by multiway cut is FPT
- A polynomial kernel for deletion to the scattered class of cliques and trees
- Parameterized complexity of feedback vertex set with connectivity constraints
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Improved algorithms for feedback vertex set problems
- An efficient algorithm for minimum feedback vertex sets in rotator graphs
This page was built for publication: Faster fixed parameter tractable algorithms for finding feedback vertex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944523)
