Cluster Vertex Deletion on Chordal Graphs
Data Structures and Algorithms
2026-04-23 v1
Abstract
We present a polynomial-time algorithm for the cluster vertex deletion problem on chordal graphs, resolving an open question posed in different contexts by Cao et al. [Theoretical Computer Science, 2018], Aprile et al. [Mathematical Programming, 2023], Chakraborty et al. [Discrete Applied Mathematics, 2024], and Hsieh et al. [Algorithmica, 2024]. We use dynamic programming over clique trees and reduce the computation of the optimal subproblem value to the minimization of a submodular set function.
Cite
@article{arxiv.2604.20457,
title = {Cluster Vertex Deletion on Chordal Graphs},
author = {Yixin Cao and Peng Li},
journal= {arXiv preprint arXiv:2604.20457},
year = {2026}
}