Vertex Deletion Problems on Chordal Graphs
Data Structures and Algorithms
2017-08-02 v2
Abstract
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.
Cite
@article{arxiv.1707.08690,
title = {Vertex Deletion Problems on Chordal Graphs},
author = {Yixin Cao and Yuping Ke and Yota Otachi and Jie You},
journal= {arXiv preprint arXiv:1707.08690},
year = {2017}
}