A polynomial-time algorithm exists for cluster vertex deletion on chordal graphs via dynamic programming on clique trees reduced to submodular minimization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Cluster Vertex Deletion on Chordal Graphs
A polynomial-time algorithm exists for cluster vertex deletion on chordal graphs via dynamic programming on clique trees reduced to submodular minimization.