Pages that link to "Item:Q4936659"
From MaRDI portal
The following pages link to Polynomial algorithm for finding the largest independent sets in graphs without forks (Q4936659):
Displaying 50 items.
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- Critical hereditary graph classes: a survey (Q518125) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- Augmenting graphs for independent sets (Q705491) (← links)
- Graphs without large apples and the maximum weight independent set problem (Q742580) (← links)
- Penta-extensions of hereditary classes of graphs (Q813334) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- On finding augmenting graphs (Q955317) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes (Q1029074) (← links)
- Large independent sets in random regular graphs (Q1034530) (← links)
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← links)
- On easy and hard hereditary classes of graphs with respect to the independent set problem (Q1414579) (← links)
- Struction revisited (Q1414580) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587) (← links)
- Stable sets in two subclasses of banner-free graphs (Q1414588) (← links)
- Some results on maximum stable sets in certain \(P_{5}\)-free graphs (Q1414592) (← 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)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- A new distributed approximation algorithm for the maximum weight independent set problem (Q1793873) (← links)
- Chordal bipartite graphs of bounded tree- and clique-width (Q1827785) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← 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)
- Few induced disjoint paths for \(H\)-free graphs (Q2098179) (← 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)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← 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)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- The maximum independent set problem in subclasses of subcubic graphs (Q2346341) (← links)
- Polynomial-time approximation algorithms for the coloring problem in some cases (Q2359789) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- From matchings to independent sets (Q2403787) (← links)
- A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs (Q2403797) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)