On robust algorithms for the maximum weight stable set problem
From MaRDI portal
Recommendations
- Robust algorithms for the stable set problem
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
Cited in
(14)- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes
- Robust algorithms for the stable set problem
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time.
- Structural parameterizations with modulator oblivion
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- Robust maximum weighted independent-set problems on interval graphs
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
- Solving problems on special classes of graphs
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Combining decomposition approaches for the maximum weight stable set problem
- Structural parameterizations with modulator oblivion
- New applications of clique separator decomposition for the maximum weight stable set problem
This page was built for publication: On robust algorithms 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 Q4782740)