{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T03:54:12Z","timestamp":1777694052831,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(97)00176-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"229-243","source":"Crossref","is-referenced-by-count":45,"title":["Autocorrelation coefficient for the graph bipartitioning problem"],"prefix":"10.1016","volume":"191","author":[{"given":"E.","family":"Angel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00176-X_BIB1","series-title":"An Introduction to Probability Theory and its Applications","author":"Feller","year":"1972"},{"key":"10.1016\/S0304-3975(97)00176-X_BIB2","series-title":"Computers and Intractability \u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"6","key":"10.1016\/S0304-3975(97)00176-X_BIB3","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: an experimental evaluation; Part I, graph partitioning","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(97)00176-X_BIB4","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","article-title":"Optimization by simulated annealing: an experimental evaluation; Part II, graph coloring and number partitioning","volume":"39","author":"Johnson","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0304-3975(97)00176-X_BIB5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/S0304-3975(97)00176-X_BIB6","doi-asserted-by":"crossref","first-page":"3103","DOI":"10.1088\/0305-4470\/25\/11\/018","article-title":"Correlation structure of the landscape of the graph-bipartitioning problem","volume":"25","author":"Stadler","year":"1992","journal-title":"J. Phys. A"},{"key":"10.1016\/S0304-3975(97)00176-X_BIB7","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0375-9601(92)90557-3","article-title":"The landscape of the traveling salesman problem","volume":"161","author":"Stadler","year":"1992","journal-title":"Phys. Lett. A"},{"key":"10.1016\/S0304-3975(97)00176-X_BIB8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF00202749","article-title":"Correlated and uncorrelated fitness landscapes and how to tell the difference","volume":"63","author":"Weinberger","year":"1990","journal-title":"Biol. Cybernet."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700176X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700176X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T04:57:32Z","timestamp":1555390652000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700176X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S030439759700176X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00176-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}