Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs

@inproceedings{Guo2007ProblemKF,
  title={Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs},
  author={Jiong Guo},
  booktitle={ISAAC},
  year={2007}
}
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-complete edge deletion problems where the goal graph has to be a chain, a split, a threshold, or a co-trivially perfect graph, respectively. All these four graph classes are characterized by a common forbidden induced subgraph 2K2, that is, an independent pair of edges. We present the seemingly first non-trivial… CONTINUE READING
25 Citations
20 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 20 references

Computing the minimum fill-in is NP-complet

  • M. Yannakakis
  • SIAM Journal on Algebraic and Discrete Methods 2…
  • 1981
Highly Influential
6 Excerpts

Graph Classes: a Survey

  • A. Brandstädt, V. B. Le, J. P. Spinrad
  • SIAM Monographs on Discrete Mathematics and…
  • 1999
Highly Influential
3 Excerpts

Split graphs

  • S. Földes, P. L. Hammer
  • Congressus Numerantium 19, 311–315
  • 1977
Highly Influential
3 Excerpts

Polynomial-time linear kernelization for Cluster Editing

  • M. R. Fellows, M. A. Langston, F. Rosamond, P. Shaw
  • Proc. 16th FCT. LNCS, Springer, Heidelberg
  • 2007
2 Excerpts

Similar Papers

Loading similar papers…