Fundamentals of Computation Theory
From MaRDI portal
Publication:5492956
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- New applications of clique separator decomposition for the maximum weight stable set problem
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- Optimal decomposition by clique separators
Cited in
(10)- Decomposition by clique separators
- scientific article; zbMATH DE number 7743715 (Why is no real title available?)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Combining decomposition approaches for the maximum weight stable set problem
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- New applications of clique separator decomposition for the maximum weight stable set problem
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Decomposition techniques applied to the clique-stable set separation problem
This page was built for publication: Fundamentals of Computation Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5492956)
