Highly Influenced

# 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} }

- Published 2007 in ISAAC
DOI:10.1007/978-3-540-77120-3_79

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

#### From This Paper

##### Figures, tables, and topics from this paper.

25 Citations

20 References

Similar Papers