A cubic kernel for feedback vertex set and loop cutset
From MaRDI portal
Recommendations
Cites work
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A Linear Kernel for Planar Feedback Vertex Set
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A More Effective Linear Kernelization for Cluster Editing
- A Short Proof of the Factor Theorem for Finite Graphs
- Algorithms and Data Structures
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computing and Combinatorics
- Exact Computation of Maximum Induced Forest
- Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 5158513 (Why is no real title available?)
- scientific article; zbMATH DE number 5485529 (Why is no real title available?)
- scientific article; zbMATH DE number 125608 (Why is no real title available?)
- scientific article; zbMATH DE number 1979503 (Why is no real title available?)
- scientific article; zbMATH DE number 1982177 (Why is no real title available?)
- scientific article; zbMATH DE number 1467487 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Maximum skew-symmetric flows and matchings
- Necessary edges in k-chordalisations of graphs
- ON DISJOINT CYCLES
- On Problems without Polynomial Kernels (Extended Abstract)
- Parameterized and Exact Computation
- Polynomial-time data reduction for dominating set
- The Undirected Feedback Vertex Set Problem Has a Poly(k) Kernel
- Vertex cover: Further observations and further improvements
- Vertex packings: Structural properties and algorithms
Cited in
(34)- Polynomial kernels for deletion to classes of acyclic digraphs
- Faster deterministic \textsc{Feedback Vertex Set}
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- Towards a polynomial kernel for directed feedback vertex set
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- A quartic kernel for pathwidth-one vertex deletion
- A 13k-kernel for planar feedback vertex set via region decomposition
- Parameterized complexity of vertex deletion into perfect graph classes
- A Cubic Kernel for Feedback Vertex Set
- Kernelization: new upper and lower bound techniques
- Parameterized complexity of vertex deletion into perfect graph classes
- Approximation and kernelization for chordal vertex deletion
- A randomized polynomial kernel for subset feedback vertex set
- A quadratic kernel for feedback vertex set
- Generalized pseudoforest deletion: algorithms and uniform kernel
- Computing kernels in parallel: lower and upper bounds
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
- Towards a polynomial kernel for directed feedback vertex set
- Linear-time kernelization for feedback vertex set
- Representative sets and irrelevant vertices: new tools for kernelization
- scientific article; zbMATH DE number 7286685 (Why is no real title available?)
- Tree deletion set has a polynomial kernel but no \(\mathrm{OPT}^\mathcal{O}(1)\) approximation)
- Kernelization for feedback vertex set via elimination distance to a forest
- Kernelization for feedback vertex set via elimination distance to a forest
- Kernel bounds for disjoint cycles and disjoint paths
- A 4k^2 kernel for feedback vertex set
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Search-space reduction via essential vertices
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- Search-space reduction via essential vertices
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- Boundaried kernelization
- Subset feedback vertex set parameterized by multiway cut is FPT
- Enumeration kernels for vertex cover and feedback vertex set
This page was built for publication: A cubic kernel for feedback vertex set and loop cutset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968273)
