Robust algorithms for the stable set problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1839471
- On the stable set problem in special \(P_{5}\)-free graphs
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs
- Stable sets in claw-free graphs: a journey through algorithms and polytopes
Cited in
(19)- New applications of clique separator decomposition for the maximum weight stable set problem
- Finding a strong stable set or a Meyniel obstruction in any graph
- scientific article; zbMATH DE number 1947419 (Why is no real title available?)
- Extending the MAX algorithm for maximum independent set
- Reductions for the stable set problem
- The 0-1 inverse maximum stable set problem
- Co-bipartite neighborhood edge elimination orderings
- Stable sets in two subclasses of banner-free graphs
- scientific article; zbMATH DE number 1839471 (Why is no real title available?)
- Robust algorithms for restricted domains
- Solving problems on special classes of graphs
- Robust algorithms: a different approach to oracles
- Solving problems on graphs of high rank-width
- Polynomially solvable cases for the maximum stable set problem
- On independent vertex sets in subclasses of apple-free graphs
- scientific article; zbMATH DE number 2190095 (Why is no real title available?)
- Solving problems on graphs of high rank-width
- The stable set problem and the thinness of a graph
- New sufficient conditions for \(\alpha\)-redundant vertices
This page was built for publication: Robust algorithms for the stable set problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1411110)
