Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
From MaRDI portal
Recommendations
- Structural Parameterizations of Feedback Vertex Set
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
- Generalized pseudoforest deletion: algorithms and uniform kernel
- On feedback vertex set: new measure and new structures
- Generalized pseudoforest deletion: algorithms and uniform kernel
Cites work
- Title not available (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A cubic kernel for feedback vertex set and loop cutset
- A fast branching algorithm for cluster vertex deletion
- A unified approximation algorithm for node-deletion problems
- Data reduction for graph coloring problems
- Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Faster deterministic \textsc{Feedback Vertex Set}
- Feedback vertex set on AT-free graphs
- Fundamentals of parameterized complexity
- Graph theory
- Infeasibility of instance compression and succinct PCPs for NP
- Kernel bounds for disjoint cycles and disjoint paths
- Kernelization Lower Bounds by Cross-Composition
- Kernels for structural parameterizations of vertex cover -- case of small degree modulators
- Minimum weakly fundamental cycle bases are hard to find
- On feedback vertex set: new measure and new structures
- On graphs with polynomially solvable maximum-weight clique problem
- On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
- Parameterized algorithms
- Parameterized algorithms for deletion to \((r,\ell)\)-graphs
- Parametrized complexity theory.
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Vertex cover problem parameterized above and below tight bounds
- Vertex cover structural parameterization revisited
- Which problems have strongly exponential complexity?
- \textsc{Split Vertex Deletion} meets \textsc{Vertex Cover}: new fixed-parameter and exact exponential-time algorithms
Cited in
(9)- Kernelization for feedback vertex set via elimination distance to a forest
- Kernelization for feedback vertex set via elimination distance to a forest
- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters
- FPT algorithms for connected feedback vertex set
- FPT algorithms and kernels for the directed k-leaf problem
- Structural parameterizations with modulator oblivion
- Structural parameterizations with modulator oblivion
- Structural parameterizations of Tracking Paths problem
- Structural Parameterizations of Feedback Vertex Set
This page was built for publication: Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722549)
