Difference determines the degree: structural kernelizations of component order connectivity
From MaRDI portal
Cites work
- A 4k^2 kernel for feedback vertex set
- A kernel of order 2k-c k for vertex cover
- A randomized polynomial kernelization for vertex cover with a smaller parameter
- Bridge-depth characterizes which minor-closed structural parameterizations of vertex cover admit a polynomial kernel
- Hitting forbidden minors: approximation and kernelization
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- scientific article; zbMATH DE number 6857816 (Why is no real title available?)
- Kernelization. Theory of parameterized preprocessing
- Linear kernels for separating a graph into components of bounded size
- Parameterized algorithms
- Polynomial kernels for vertex cover parameterized by small degree modulators
- Representative sets and irrelevant vertices: new tools for kernelization
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Smaller parameters for vertex cover kernelization
- Subset feedback vertex set in chordal and split graphs
- Uniform kernelization complexity of hitting forbidden minors
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Vertex cover structural parameterization revisited
Cited in
(2)
This page was built for publication: Difference determines the degree: structural kernelizations of component order connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926205)
