2026-07-25T06:06:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8379 2024-03-06T10:41:57Z ddc:004 open_access

Vertex Deletion Problems on Chordal Graphs Cao, Yixin Ke, Yuping Otachi, Yota You, Jie vertex deletion problem maximum subgraph chordal graph (unit) interval graph split graph hereditary property NP-complete polynomial-time algori 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yixin Cao and Yuping Ke and Yota Otachi and Jie You 2018 Is Part Of LIPIcs, Volume 93, 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.FSTTCS.2017.22 urn:nbn:de:0030-drops-83799 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2017.22 eng https://creativecommons.org/licenses/by/3.0/legalcode