Highly Influential

7 Excerpts

@article{Jansen2017ApproximationAK, title={Approximation and Kernelization for Chordal Vertex Deletion}, author={Bart M. P. Jansen and Marcin Pilipczuk}, journal={SIAM J. Discrete Math.}, year={2017}, volume={32}, pages={2258-2301} }

- Published in SIAM J. Discrete Math. 2017
DOI:10.1137/17M112035X

The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel for ChVD under the parameterization by the solution size, as well as poly(opt) approximation algorithm. The first result answers an open problem of Marx from 2006 [WG 2006, LNCS 4271, 37–48].

SHOWING 1-10 OF 51 REFERENCES

Highly Influential

7 Excerpts

Highly Influential

6 Excerpts

Highly Influential

6 Excerpts

Highly Influential

4 Excerpts

Highly Influential

4 Excerpts

Highly Influential

4 Excerpts

Highly Influential

4 Excerpts

Highly Influential

4 Excerpts

Highly Influential

6 Excerpts

Highly Influential

6 Excerpts

Loading similar papers…