New applications of clique separator decomposition for the maximum weight stable set problem
From MaRDI portal
(Redirected from Publication:868954)
Recommendations
- Fundamentals of Computation Theory
- 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
- scientific article; zbMATH DE number 1839471
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3908479 (Why is no real title available?)
- scientific article; zbMATH DE number 3445275 (Why is no real title available?)
- scientific article; zbMATH DE number 861332 (Why is no real title available?)
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- A New Algorithm for Generating All the Maximal Independent Sets
- A nice class for the vertex packing problem
- A note on \(\alpha\)-redundant vertices in graphs
- A transformation which preserves the clique number
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- An upper bound on the number of cliques in a graph
- Arboricity and Subgraph Listing Algorithms
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
- Computing independent sets in graphs with large girth
- Decomposition by clique separators
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Modular decomposition and transitive orientation
- On (\(P_{5}\), diamond)-free graphs
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- On \(\alpha\)-redundant vertices in \(P_{5}\)-free graphs
- On algorithms for (\(P_5\), gem)-free graphs
- On diameters and radii of bridged graphs
- On easy and hard hereditary classes of graphs with respect to the independent set problem
- On graphs with polynomially solvable maximum-weight clique problem
- On linear and circular structure of (claw, net)-free graphs
- On maximal independent sets of vertices in claw-free graphs
- On the stability number of claw-free \(P_5\)-free and more general graphs
- On the stable set problem in special \(P_{5}\)-free graphs
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- On the structure of (\(P_{5}\),\,gem)-free graphs
- On the vertex packing problem
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Robust algorithms for the stable set problem
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs
- Stability in CAN-free graphs
- Stability in \(P_5\)- and banner-free graphs
- Stability in circular arc graphs
- Stability number of bull- and chair-free graphs
- Stability number of bull- and chair-free graphs revisited
- Stable sets in certain \(P_6\)-free graphs
- Structure and stability number of chair-, co-P- and gem-free graphs revisited
- The complexity of generalized clique packing
- The ellipsoid method and its consequences in combinatorial optimization
- The struction of a graph: Application to CN-free graphs
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem
Cited in
(16)- Combining decomposition approaches for the maximum weight stable set problem
- Organizing the atoms of the clique separator decomposition into an atom tree
- 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
- On stable cutsets in claw-free graphs and planar graphs
- Decomposition techniques applied to the clique-stable set separation problem
- Complexity results for equistable graphs and related classes
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
- On independent vertex sets in subclasses of apple-free graphs
- scientific article; zbMATH DE number 7743715 (Why is no real title available?)
- On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem
- Maximum weight independent sets in hole- and dart-free graphs
- Weighted independent sets in classes of \(P_6\)-free graphs
- Addendum to: ``Maximum weight independent sets in hole- and co-chair-free graphs
- Fundamentals of Computation Theory
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
This page was built for publication: New applications of clique separator decomposition for the maximum weight stable set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868954)
