A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
From MaRDI portal
Publication:4483540
Recommendations
- An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
- scientific article; zbMATH DE number 1839471
Cited in
(62)- Clique-circulants and the stable set polytope of fuzzy circular interval graphs
- Maximum regular induced subgraphs in \(2P_3\)-free graphs
- Colouring squares of claw-free graphs
- A reduction algorithm for the weighted stable set problem in claw-free graphs
- The complexity of dissociation set problems in graphs
- Separation routine and extended formulations for the stable set problem in claw-free graphs
- Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs
- A sufficient condition to extend polynomial results for the maximum independent set problem
- On the facets of stable set polytopes of circular interval graphs
- Solving the weighted stable set problem in claw-free graphs via decomposition
- Stable sets in claw-free graphs: a journey through algorithms and polytopes
- Independent sets in \((P_4+P_4\),triangle)-free graphs
- Maximum weight independent sets for (\(S_{1,2,4}\), triangle)-free graphs in polynomial time
- The 0-1 inverse maximum stable set problem
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs
- Finding augmenting chains in extensions of claw-free graphs
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
- Penta-extensions of hereditary classes of graphs
- Minimum cost and list homomorphisms to semicomplete digraphs
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- On the recognition of fuzzy circular interval graphs
- Robust algorithms for the stable set problem
- Minimum weighted clique cover on claw‐free perfect graphs
- scientific article; zbMATH DE number 1839471 (Why is no real title available?)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
- The limits of local search for weighted \(k\)-set packing
- Maximum weight independent sets for (\(P_7\), triangle)-free graphs in polynomial time
- The stable set polytope of quasi-line graphs
- On the feedback vertex set polytope of a series-parallel graph
- scientific article; zbMATH DE number 1187143 (Why is no real title available?)
- Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs
- scientific article; zbMATH DE number 6783420 (Why is no real title available?)
- Tight results on minimum entropy set cover
- Independent sets of maximum weight in (\(p,q\))-colorable graphs.
- Hereditary efficiently dominatable graphs
- Independent sets in extensions of 2\(K_{2}\)-free graphs
- On independent vertex sets in subclasses of apple-free graphs
- Squares of Intersection Graphs and Induced Matchings
- Maximum colorful independent sets in vertex-colored graphs
- An efficient local search algorithm with large neighborhoods for the maximum weighted independent set problem†
- On the complexity of the independent set problem in triangle graphs
- Colouring squares of claw-free graphs
- Treewidth versus clique number. I: Graph classes with a forbidden structure
- Graphs without large apples and the maximum weight independent set problem
- On minimal prime extensions of a four-vertex graph in a prime graph
- An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\)
- Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time
- New results on independent sets in extensions of \(2K_2\)-free graphs
- Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs
- Combinatorics and algorithms for augmenting graphs
- The stable set problem and the thinness of a graph
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- Sparse regular induced subgraphs in \(2P_3\)-free graphs
- Coloring fuzzy circular interval graphs
- A polytime preprocess algorithm for the maximum independent set problem
- The limits of local search for weighted \(k\)-set packing
- Packing \(K_r\)s in bounded degree graphs
- Hard and easy instances of L-tromino tilings
- scientific article; zbMATH DE number 2230228 (Why is no real title available?)
- On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
This page was built for publication: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4483540)
