Pages that link to "Item:Q1701093"

The following pages link to Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093):

Displaying 13 items.

• 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)
• Simple games versus weighted voting games: bounding the critical threshold value (Q1986594) (← links)
• Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
• Independent sets in \((P_4+P_4\),triangle)-free graphs (Q2053685) (← links)
• Vertex cover at distance on \(H\)-free graphs (Q2115860) (← links)
• New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
• (Q2721980) (← links)
• Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs (Q5043646) (← links)
• (Q5365068) (← links)
• (Q5874491) (← links)
• Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
• Polynomial-time Algorithm for Maximum Weight Independent Set on <i>P</i> ₆ -free Graphs (Q6058231) (← links)
• Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)