Pages that link to "Item:Q1414587"
From MaRDI portal
The following pages link to \(P_{5}\)-free augmenting graphs and the maximum stable set problem (Q1414587):
Displaying 16 items.
- Polynomial algorithms for the maximum stable set problem on particular classes of \(P_{5}\)-free graphs (Q290201) (← links)
- The maximum independent set problem in subclasses of \(S_{i, j, k}\)-free graphs (Q322186) (← links)
- New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) (← links)
- Maximum independent sets in subclasses of \(P_{5}\)-free graphs (Q976106) (← links)
- Finding augmenting chains in extensions of claw-free graphs (Q1007635) (← links)
- An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs (Q1414237) (← 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)
- Stability in \(P_5\)- and banner-free graphs (Q1580977) (← links)
- Stability number in subclasses of \(P_5\)-free graphs (Q1764380) (← links)
- Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) (← links)
- On the stable set problem in special \(P_{5}\)-free graphs (Q1861559) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data (Q2283785) (← links)
- Stable set and clique polytopes of \((P_{5},\,\mathrm{gem})\)-free graphs (Q2461195) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
