{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:57Z","timestamp":1759335657828},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90151-i","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"145-156","source":"Crossref","is-referenced-by-count":29,"title":["The performance of an eigenvalue bound on the max-cut problem in some classes of graphs"],"prefix":"10.1016","volume":"111","author":[{"given":"C.","family":"Delorme","sequence":"first","affiliation":[]},{"given":"S.","family":"Poljak","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90151-I_BIB1","series-title":"Rapport de Recherche 186","article-title":"On the complexity of max-cut","author":"Barahona","year":"1980"},{"key":"10.1016\/0012-365X(93)90151-I_BIB2","series-title":"Report 83273-OR","article-title":"On some weakly bipartite graphs","author":"Barahona","year":"1983"},{"key":"10.1016\/0012-365X(93)90151-I_BIB3","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1137\/0606048","article-title":"On transportation problems with upper bounds on leading rectangles","volume":"6","author":"Barnes","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"article-title":"Graph Theory with Applications","year":"1977","author":"Bondy","key":"10.1016\/0012-365X(93)90151-I_BIB4"},{"key":"10.1016\/0012-365X(93)90151-I_BIB5","article-title":"Distance-regular Graphs","volume":"Band 18","author":"Brouwer","year":"1989"},{"key":"10.1016\/0012-365X(93)90151-I_BIB6","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0195-6698(85)80004-4","article-title":"On a pair of dual subschemes of the Hamming scheme Hn(q)","volume":"6","author":"Calderbanks","year":"1985","journal-title":"European J. Combin."},{"key":"10.1016\/0012-365X(93)90151-I_BIB7","doi-asserted-by":"crossref","unstructured":"C. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Math. Program., submitted.","DOI":"10.1007\/BF01585184"},{"year":"1974","series-title":"Introduction to Minimax","author":"Dem'ianov","key":"10.1016\/0012-365X(93)90151-I_BIB8"},{"key":"10.1016\/0012-365X(93)90151-I_BIB9","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"Donath","year":"1973","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0012-365X(93)90151-I_BIB10","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0012-365X(93)90151-I_BIB11","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","article-title":"Weakly bipartite graphs and the max-cut problem","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0012-365X(93)90151-I_BIB12","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."},{"year":"1969","series-title":"Theory of Matrices","author":"Lancaster","key":"10.1016\/0012-365X(93)90151-I_BIB13"},{"key":"10.1016\/0012-365X(93)90151-I_BIB14","series-title":"IMAG","article-title":"Composition of graphs and the bipartite subgraph polytope","author":"Mahjoub","year":"1984"},{"issue":"115","key":"10.1016\/0012-365X(93)90151-I_BIB15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.21136\/CMJ.1990.102386","article-title":"Eigenvalues and the max-cut problem","volume":"40","author":"Mohar","year":"1990","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0012-365X(93)90151-I_BIB16","first-page":"502","article-title":"Finding the maximal cut in a graph","volume":"10","author":"Orlova","year":"1972","journal-title":"Engrg. Cybernetics"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390151I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390151I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:21:13Z","timestamp":1621030873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390151I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390151I"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90151-i","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}