On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
From MaRDI portal
Publication:3596359
DOI10.1007/11496915_20zbMath1119.05087OpenAlexW1556454392MaRDI QIDQ3596359
Andreas Brandstädt, Chính T. Hoàng
Publication date: 30 August 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11496915_20
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
On independent vertex sets in subclasses of apple-free graphs ⋮ Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs ⋮ New applications of clique separator decomposition for the maximum weight stable set problem ⋮ Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs ⋮ On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem ⋮ A polynomial algorithm to find an independent set of maximum weight in a fork-free graph ⋮ On Distance-3 Matchings and Induced Matchings
This page was built for publication: On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
