Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
From MaRDI portal
Publication:1144589
DOI10.1016/0012-365X(90)90287-RzbMath0444.05049WikidataQ56335613 ScholiaQ56335613MaRDI QIDQ1144589
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
05C35: Extremal problems in graph theory
68R10: Graph theory (including graph drawing) in computer science
Related Items
WELL-COVERED GRAPHS: A SURVEY, Polynomial algorithm for finding the largest independent sets in graphs without forks, Unnamed Item, Hard graphs for the maximum clique problem, A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, On a classification of independence systems, Augmenting graphs for independent sets, Cycles of given length in some \(K_{1,3}\)-free graphs, TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph, Stability in CAN-free graphs, Recent trends in combinatorial optimization, Penta-extensions of hereditary classes of graphs, On the feedback vertex set polytope of a series-parallel graph, New applications of clique separator decomposition for the maximum weight stable set problem, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, The stable set polytope of quasi-line graphs, On finding augmenting graphs, Finding augmenting chains in extensions of claw-free graphs, Efficient robust algorithms for the maximum weight stable set problem in chair-free graph classes, 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, The struction of a graph: Application to CN-free graphs, The complexity of generalized clique packing, Quelques utilisations de la STRUCTION. (Some applications of STRUCTION), On maximal independent sets of vertices in claw-free graphs, Polytope des independants d'un graphe série-parallèle, Independence systems with continuous cardinality of bases, Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs, Stability number of bull- and chair-free graphs, Stable sets in certain \(P_6\)-free graphs, The maximum clique problem, Extending matchings in graphs: A survey, Extending matchings in claw-free graphs, Edge-disjoint packings of graphs, Claw-free graphs---a survey, Matching extension in \(K_{1,r}\)-free graphs with independent claw centers, A nice class for the vertex packing problem, On the use of Boolean methods for the computation of the stability number, Independent domination in finitely defined classes of graphs, Scalar aggregation in inconsistent databases., Stability number of bull- and chair-free graphs revisited, An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs, On easy and hard hereditary classes of graphs with respect to the independent set problem, On well-covered triangulations. I, \(P_{5}\)-free augmenting graphs and the maximum stable set problem, Stable sets in two subclasses of banner-free graphs, Some results on maximum stable sets in certain \(P_{5}\)-free graphs, Clique family inequalities for the stable set polytope of quasi-line graphs., Induced matchings in intersection graphs., Stabex method for extension of \(\alpha\)-polynomial hereditary classes., Stability in \(P_5\)- and banner-free graphs, On claw-free asteroidal triple-free graphs, Independent sets in extensions of 2\(K_{2}\)-free graphs, Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time., Independent sets of maximum weight in (\(p,q\))-colorable graphs., Polynomially solvable cases for the maximum stable set problem, Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs, On the vertex packing problem, Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs, Classes of perfect graphs, Augmenting chains in graphs without a skew star., On balanced graphs, Unnamed Item, On Some Properties of the Struction of a Graph, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, The Maximum Independent Set Problem in Planar Graphs
Cites Work
