Weakly bipartite graphs and the Max-cut problem
- 1 October 1981
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 1 (1) , 23-27
- https://doi.org/10.1016/0167-6377(81)90020-1
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965