A remark on max-cut problem with an application to digital-analogue convertors
- 30 April 1986
- journal article
- other
- Published by Elsevier in Operations Research Letters
- Vol. 4 (6), 289-291
- https://doi.org/10.1016/0167-6377(86)90031-3
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Weakly bipartite graphs and the Max-cut problemOperations Research Letters, 1981
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975