Smaller Parameters for Vertex Cover Kernelization

@inproceedings{Hols2017SmallerPF,
  title={Smaller Parameters for Vertex Cover Kernelization},
  author={Eva-Maria C. Hols and Stefan Kratsch},
  booktitle={IPEC},
  year={2017}
}
We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Stromme [WG 2016] who gave a kernel with O(|X|^{12}) vertices when X is a vertex set such that each connected component of G-X contains at most one cycle, i.e., X is a modulator to a pseudoforest. We strongly generalize this result by using modulators to d-quasi-forests, i.e., graphs where each connected component has a feedback vertex set of size… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

Levit . On the number of vertices belonging to all maximum stable sets of a graph

E Vadim
  • Discrete Applied Mathematics
  • 2016

Fomin and Torstein J . F . Strømme . Vertex cover structural parameterization revisited

V. Fedor
  • Graph Theory , 4 th Edition , volume 173 of Graduate texts in mathematics
  • 2012

Kernels for structural

Diptapriyo Majumdar, Venkatesh Raman, Saket Saurabh
  • Computer Society,
  • 2012

Representative Sets and Irrelevant Vertices: New Tools for Kernelization

  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
  • 2011