Pages that link to "Item:Q3503841"

The following pages link to A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841):

Displaying 16 items.

• Structure of squares and efficient domination in graph classes (Q338382) (← links)
• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
• A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• 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 (Q1041408) (← 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)
• Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
• Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
• (Q2861525) (← links)
• Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
• Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
• On the Stable Set Polytope of Claw-Free Graphs (Q5505672) (← links)
• (Q5743477) (← links)
• Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)