Pages that link to "Item:Q5901434"

The following pages link to A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434):

Displaying 50 items.

• Weighted independent sets in classes of \(P_6\)-free graphs (Q298979) (← links)
• Tent and a subclass of \(P_{5}\)-free graphs (Q327628) (← links)
• Structure of squares and efficient domination in graph classes (Q338382) (← links)
• Maximum weight independent sets in classes related to claw-free graphs (Q344862) (← links)
• A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
• On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem (Q385962) (← links)
• Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs (Q477653) (← links)
• Hybrid tractability of valued constraint problems (Q646503) (← links)
• Complexity results for equistable graphs and related classes (Q646721) (← links)
• Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
• Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
• Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
• Weighted independent sets in a subclass of \(P_6\)-free graphs (Q906493) (← links)
• Weighted efficient domination in two subclasses of \(P_6\)-free graphs (Q908292) (← links)
• Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
• Maximum weight independent set for \(\ell\)claw-free graphs in polynomial time (Q1701093) (← links)
• Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
• Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
• Sparse regular induced subgraphs in \(2P_3\)-free graphs (Q1799386) (← links)
• Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
• On the maximum independent set problem in subclasses of subcubic graphs (Q2018543) (← links)
• Subexponential-time algorithms for finding large induced sparse subgraphs (Q2041989) (← 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)
• A characterization of claw-free CIS graphs and new results on the order of CIS graphs (Q2132328) (← links)
• New results on independent sets in extensions of \(2K_2\)-free graphs (Q2159731) (← links)
• Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
• Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
• On the complexity of the independent set problem in triangle graphs (Q2275391) (← links)
• The complexity of dissociation set problems in graphs (Q2275943) (← links)
• Excluding the fork and antifork (Q2305900) (← links)
• The \(k\)-separator problem: polyhedra, complexity and approximation results (Q2354313) (← links)
• From matchings to independent sets (Q2403787) (← links)
• Independent sets in some classes of \(S_{i,j,k}\)-free graphs (Q2410110) (← links)
• Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
• A note on efficient domination in a superclass of \(P_5\)-free graphs (Q2446593) (← links)
• Dominating induced matchings in graphs without a skew star (Q2447537) (← links)
• Independent Sets in Classes Related to Chair-Free Graphs (Q2795949) (← links)
• Maximum Weight Independent Sets in ( $$S_{1,1,3}$$ , bull)-free Graphs (Q2817880) (← links)
• Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
• Approximation Algorithm for the Distance-3 Independent Set Problem on Cubic Graphs (Q2980912) (← links)
• The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
• Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
• Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
• (Q5874491) (← links)
• (Q5874504) (← links)
• Maximum independent sets in subcubic graphs: new results (Q5919020) (← links)
• Parameterized inapproximability of independent set in \(H\)-free graphs (Q5925689) (← links)
• Combining decomposition approaches for the maximum weight stable set problem (Q6040632) (← links)