scientific article; zbMATH DE number 6783420
From MaRDI portal
Publication:5365068
Recommendations
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\)
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Stable sets in claw-free graphs: a journey through algorithms and polytopes
- A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Maximum weight independent set for claw-free graphs in polynomial time
Cited in
(30)- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
- Maximum weight independent set for claw-free graphs in polynomial time
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
- An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\)
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- New results on independent sets in extensions of \(2K_2\)-free graphs
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Efficient recognition of equimatchable graphs
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- Vertex elimination orderings for hereditary graph classes
- Stable sets in claw-free graphs: a journey through algorithms and polytopes
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Algorithms for Square-3PC(\cdot, \cdot)-Free Berge Graphs
- Weighted well-covered claw-free graphs
- Parameterized complexity of induced graph matching on claw-free graphs
- A polynomial Turing-kernel for weighted independent set in bull-free graphs
- Hereditary efficiently dominatable graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- Minimum weighted clique cover on claw‐free perfect graphs
- (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
- Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs
- Packing K_rs in bounded degree graphs
- Recognizing \(\text{W}_2\) graphs
- Independent sets of maximum weight beyond claw-free graphs and related problems
- Graphs without large apples and the maximum weight independent set problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5365068)
