{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreidkisqyajo5ru65pey6mkck6i2ixupnxehjsd4hcpd62hnifvlqn4",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mk5a2guvxgk2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.20457v1",
  "publishedAt": "2026-04-23T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Yixin Cao",
    "Peng Li"
  ],
  "textContent": "**Authors:** Yixin Cao, Peng Li\n\nWe 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.",
  "title": "Cluster Vertex Deletion on Chordal Graphs"
}