Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth
From MaRDI portal
Recommendations
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Linear time parameterized algorithms for \textsc{Subset Feedback Vertex Set}
Cites work
- A c^k n 5-approximation algorithm for treewidth
- A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary
- An FPT algorithm for edge subset feedback edge set
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Hitting minors on bounded treewidth graphs. III. Lower bounds
- scientific article; zbMATH DE number 6783431 (Why is no real title available?)
- Multi-multiway cut problem on graphs of bounded branch width
- On directed feedback vertex set parameterized by treewidth
- On the complexity of k-SAT
- Parameterized algorithms
- Planar graph bipartization in linear time
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
- Slightly superexponential parameterized problems
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
- Tight lower bounds on graph embedding problems
Cited in
(10)- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- Feedback vertex set and even cycle transversal for H-free graphs: finding large block graphs
- Computing subset transversals in \(H\)-free graphs
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Digraph coloring and distance to acyclicity
- Parameterized max min feedback vertex set
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Tree decompositions meet induced matchings: beyond max weight independent set
- Tree decompositions meet induced matchings: beyond max weight independent set
- Sparse induced subgraphs in P₇-Free graphs of bounded clique number
This page was built for publication: Close relatives of feedback vertex set without single-exponential algorithms parameterized by treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6068237)
