论文信息 - On some weakly bipartite graphs - 字舞流文

On some weakly bipartite graphs

[1] George L. Nemhauser,et al. A polynomial algorithm for the max-cut problem on graphs without long odd cycles , 1984, Math. Program..

[2] F. Barahona. The max-cut problem on graphs not contractible to K5 , 1983 .

[3] Martin Grötschel,et al. Weakly bipartite graphs and the Max-cut problem , 1981, Oper. Res. Lett..

[4] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[5] Jørgen Tind,et al. Blocking and Antiblocking Polyhedra , 1979 .

[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7] Paul D. Seymour,et al. The matroids with the max-flow min-cut property , 1977, J. Comb. Theory B.

[8] F. Hadlock,et al. Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..

[9] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[10] T. C. Hu. Multi-Commodity Network Flows , 1963 .