Pages that link to "Item:Q1144589"

The following pages link to Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589):

Displayed 50 items.

• Augmenting graphs for independent sets (Q705491) ‎ (← links)
• Cycles of given length in some \(K_{1,3}\)-free graphs (Q749554) ‎ (← links)
• TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) ‎ (← links)
• Stability in CAN-free graphs (Q762505) ‎ (← links)
• Recent trends in combinatorial optimization (Q788638) ‎ (← links)
• Penta-extensions of hereditary classes of graphs (Q813334) ‎ (← links)
• On the feedback vertex set polytope of a series-parallel graph (Q834183) ‎ (← links)
• New applications of clique separator decomposition for the maximum weight stable set problem (Q868954) ‎ (← links)
• Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) ‎ (← links)
• The stable set polytope of quasi-line graphs (Q949780) ‎ (← links)
• On finding augmenting graphs (Q955317) ‎ (← 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)
• The struction of a graph: Application to CN-free graphs (Q1068855) ‎ (← links)
• The complexity of generalized clique packing (Q1073049) ‎ (← links)
• Quelques utilisations de la STRUCTION. (Some applications of STRUCTION) (Q1080863) ‎ (← links)
• On maximal independent sets of vertices in claw-free graphs (Q1139605) ‎ (← links)
• Polytope des independants d'un graphe série-parallèle (Q1147168) ‎ (← links)
• Independence systems with continuous cardinality of bases (Q1149442) ‎ (← links)
• Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444) ‎ (← links)
• Stability number of bull- and chair-free graphs (Q1208469) ‎ (← links)
• Stable sets in certain \(P_6\)-free graphs (Q1304476) ‎ (← links)
• The maximum clique problem (Q1318271) ‎ (← links)
• Extending matchings in graphs: A survey (Q1322235) ‎ (← links)
• Extending matchings in claw-free graphs (Q1322284) ‎ (← links)
• Edge-disjoint packings of graphs (Q1326750) ‎ (← links)
• Claw-free graphs---a survey (Q1356695) ‎ (← links)
• Matching extension in \(K_{1,r}\)-free graphs with independent claw centers (Q1356714) ‎ (← links)
• A nice class for the vertex packing problem (Q1363736) ‎ (← links)
• On the use of Boolean methods for the computation of the stability number (Q1363750) ‎ (← links)
• Independent domination in finitely defined classes of graphs (Q1399990) ‎ (← links)
• Scalar aggregation in inconsistent databases. (Q1401279) ‎ (← 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)
• On well-covered triangulations. I (Q1414586) ‎ (← 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)
• Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) ‎ (← links)
• Induced matchings in intersection graphs. (Q1427466) ‎ (← links)
• Stabex method for extension of \(\alpha\)-polynomial hereditary classes. (Q1427601) ‎ (← links)
• Stability in \(P_5\)- and banner-free graphs (Q1580977) ‎ (← links)
• On claw-free asteroidal triple-free graphs (Q1613398) ‎ (← links)
• Independent sets in extensions of 2\(K_{2}\)-free graphs (Q1765375) ‎ (← links)
• Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) ‎ (← links)
• Independent sets of maximum weight in (\(p,q\))-colorable graphs. (Q1874371) ‎ (← links)
• Polynomially solvable cases for the maximum stable set problem (Q1894362) ‎ (← links)
• Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs (Q1920760) ‎ (← links)
• On the vertex packing problem (Q2366214) ‎ (← links)