Pages that link to "Item:Q5501925"

The following pages link to Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925):

Displaying 23 items.

• A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
• Equimatchable claw-free graphs (Q1660273) (← links)
• Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
• Colouring squares of claw-free graphs (Q1689990) (← 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)
• Separation routine and extended formulations for the stable set problem in claw-free graphs (Q2039230) (← links)
• Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs (Q2227542) (← 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)
• Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← links)
• On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
• Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
• Colouring Squares of Claw-free Graphs (Q4625179) (← links)
• Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
• (Q5009627) (← links)
• Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
• Extended formulations from communication protocols in output-efficient time (Q5918910) (← links)
• Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
• Linear‐time algorithms for eliminating claws in graphs (Q6082274) (← links)
• A polytime preprocess algorithm for the maximum independent set problem (Q6151535) (← links)
• Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs (Q6203477) (← links)