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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A recursive construction of acyclic matchings on independence complexes for graphs with simplicial vertices yields homotopy types for chordal graphs and generalized comparability graphs via discrete Morse theory.
Cochordal zero-divisor graphs of chain rings admit refined Betti formulas yielding 2-linear resolutions for the studied quotient rings.
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.
-
A recursive construction of an acyclic matching on the independence complex of a graph with a simplicial vertex
A recursive construction of acyclic matchings on independence complexes for graphs with simplicial vertices yields homotopy types for chordal graphs and generalized comparability graphs via discrete Morse theory.
-
Betti numbers for cochordal zero-divisor graphs of commutative rings
Cochordal zero-divisor graphs of chain rings admit refined Betti formulas yielding 2-linear resolutions for the studied quotient rings.