Pages that link to "Item:Q1144589"
From MaRDI portal
The following pages link to Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589):
Displaying 50 items.
- Regular independent sets (Q260019) (← links)
- Augmenting approach for some maximum set problems (Q284765) (← links)
- 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)
- Well-covered triangulations. IV (Q323041) (← links)
- A sufficient condition to extend polynomial results for the maximum independent set problem (Q344869) (← links)
- A note on anti-coordination and social interactions (Q386417) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- On well-covered pentagonalizations of the plane (Q526819) (← links)
- Dominating set is fixed parameter tractable in claw-free graphs (Q650938) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- 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)
- On well-covered triangulations. II. (Q967322) (← links)
- On well-covered triangulations. III (Q972324) (← 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)
- Some classical combinatorial problems on circulant and claw-free graphs: The isomorphism and coloring problems on circulant graphs and the stable set problem on claw-free graphs (Q1041408) (← 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)
