{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T15:08:39Z","timestamp":1772291319607,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1981,10,1]],"date-time":"1981-10-01T00:00:00Z","timestamp":370742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1981,10]]},"DOI":"10.1016\/0167-6377(81)90020-1","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:41:01Z","timestamp":1056984061000},"page":"23-27","source":"Crossref","is-referenced-by-count":130,"title":["Weakly bipartite graphs and the Max-cut problem"],"prefix":"10.1016","volume":"1","author":[{"given":"M.","family":"Gr\u00f6tschel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(81)90020-1_BIB1","article-title":"Sur la complexit\u00e9 du problem\u00e8 du verre de spins","author":"Barahona","year":"1979"},{"key":"10.1016\/0167-6377(81)90020-1_BIB2","article-title":"On the complexity of max cut","author":"Barahona","year":"1980"},{"key":"10.1016\/0167-6377(81)90020-1_BIB3","series-title":"Balancing signed graphs of fixed genus in polynomial time","author":"Barahona","year":"1981"},{"key":"10.1016\/0167-6377(81)90020-1_BIB4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with (0,1)-vertices","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0167-6377(81)90020-1_BIB5","series-title":"Proc. 10th Annual ACM Symposium on Theory of Computing","article-title":"On determining the genus of a graph in O(VO(g)) steps","author":"Filotti","year":"1978"},{"key":"10.1016\/0167-6377(81)90020-1_BIB6","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0167-6377(81)90020-1_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0167-6377(81)90020-1_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0204019","article-title":"Finding a maximum cut of a planar graph in polynomial time","volume":"4","author":"Hadlock","year":"1975","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0167-6377(81)90020-1_BIB9","first-page":"502","article-title":"Finding the maximum cut in a planar graph","volume":"10","author":"Orlova","year":"1975","journal-title":"Engrg. Cybernetics"},{"key":"10.1016\/0167-6377(81)90020-1_BIB10","series-title":"Proc. 10th Annual ACM Symposium on Theory of Computing","first-page":"253","article-title":"Node- and edge-deletion NP-complete problems","author":"Yannakakis","year":"1978"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637781900201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637781900201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T07:51:47Z","timestamp":1552895507000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637781900201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,10]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1981,10]]}},"alternative-id":["0167637781900201"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(81)90020-1","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1981,10]]}}}