Pages that link to "Item:Q2448908"

The following pages link to A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908):

Displaying 11 items.

• A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
• Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
• An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148) (← links)
• An augmentation algorithm for the maximum weighted stable set problem (Q1819158) (← links)
• An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\) (Q2364488) (← links)
• A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
• Reductions for the stable set problem (Q2865866) (← links)
• A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
• A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH (Q4483540) (← links)
• (Q5365068) (← links)
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)