eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2018-02-12
22:1
22:14
10.4230/LIPIcs.FSTTCS.2017.22
article
Vertex Deletion Problems on Chordal Graphs
Cao, Yixin
Ke, Yuping
Otachi, Yota
You, Jie
Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yannakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from one subclass of chordal graphs to another. We give polynomial-time algorithms or proofs of NP-completeness for most of the problems. In particular, we show that the vertex deletion problem from chordal graphs to interval graphs is NP-complete.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol093-fsttcs2017/LIPIcs.FSTTCS.2017.22/LIPIcs.FSTTCS.2017.22.pdf
vertex deletion problem
maximum subgraph
chordal graph
(unit) interval graph
split graph
hereditary property
NP-complete
polynomial-time algori