A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
暂无分享,去创建一个
Gianpaolo Oriolo | Gautier Stauffer | Ugo Pietropaoli | G. Oriolo | Gautier Stauffer | Ugo Pietropaoli
[1] A. Schrijver. A Course in Combinatorial Optimization , 1990 .
[2] Martin Milanič,et al. A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA '06.
[3] A. Tamura,et al. A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph , 2001 .
[4] William J. Cook,et al. Combinatorial optimization , 1997 .
[5] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[6] F. B. Shepherd,et al. Formulations for the stable set polytope , 1992 .
[7] George J. Minty,et al. On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.
[8] C Berge,et al. TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.
[9] Jean-Luc Fouquet,et al. A Strengthening of Ben Rebea's Lemma , 1993, J. Comb. Theory, Ser. B.
[10] L. Lovász. Matching Theory (North-Holland mathematics studies) , 1986 .
[11] Paul D. Seymour,et al. The structure of claw-free graphs , 2005, BCC.
[12] Gérard Cornuéjols,et al. Compositions for perfect graphs , 1985, Discret. Math..
[13] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[14] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..