On some weakly bipartite graphs
- 31 December 1983
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 2 (5) , 239-242
- https://doi.org/10.1016/0167-6377(83)90031-7
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- The matroids with the max-flow min-cut propertyJournal of Combinatorial Theory, Series B, 1977
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Multi-Commodity Network FlowsOperations Research, 1963