Pages that link to "Item:Q1751148"

The following pages link to An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\) (Q1751148):

Displaying 9 items.

• On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
• Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
• Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
• New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← 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)
• A reduction algorithm for the weighted stable set problem in claw-free graphs (Q2448908) (← links)
• A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs (Q3503841) (← links)
• (Q5365068) (← links)