On the cut polytope
暂无分享,去创建一个
[1] F. Harary. On the notion of balance of a signed graph. , 1953 .
[2] F. Hadlock,et al. Finding a Maximum Cut of a Planar Graph in Polynomial Time , 1975, SIAM J. Comput..
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Paul D. Seymour,et al. Matroids and Multicommodity Flows , 1981, Eur. J. Comb..
[5] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[6] F. Barahona. On the computational complexity of Ising spin glass models , 1982 .
[7] F. Barahona. The max-cut problem on graphs not contractible to K5 , 1983 .
[8] George L. Nemhauser,et al. A polynomial algorithm for the max-cut problem on graphs without long odd cycles , 1984, Math. Program..
[9] Martin Grötschel,et al. Facets of the Bipartite Subgraph Polytope , 1985, Math. Oper. Res..
[10] Siam J. CoMPtrr,et al. FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .