论文信息 - An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs - 字舞流文

An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs

G. Nemhauser | Y. Ikura

[1] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..

[2] W. H. Cunningham,et al. Theoretical Properties of the Network Simplex Method , 1979, Math. Oper. Res..

[3] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[4] George L. Nemhauser,et al. A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles , 1981, Math. Program..

[5] William H. Cunningham,et al. A network simplex method , 1976, Math. Program..

[6] George J. Minty,et al. On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[7] László Lovász,et al. Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[8] Richard M. Karp,et al. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[9] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .

[10] Najiba Sbihi,et al. Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[11] V. Chvátal. On certain polytopes associated with graphs , 1975 .

[12] D. R. Fulkerson. On the Perfect Graph Theorem , 1973 .