{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:34:34Z","timestamp":1648820074420},"reference-count":17,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":8202,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0166-218x(91)90046-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"221-227","source":"Crossref","is-referenced-by-count":1,"title":["Lattice bandwidth of random graphs"],"prefix":"10.1016","volume":"30","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zevi","family":"Miller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(91)90046-Y_BIB1","series-title":"Tech. Rept.","article-title":"The grid embedding problem is NP-complete even for edge length 2","author":"Bertolazzi","year":"1983"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB2","article-title":"The complexity of minimizing wire lengths in VLSI layouts","author":"Bhatt","year":"1983","journal-title":"Manuscript"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB3","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF02122551","article-title":"The chromatic number of random graphs","volume":"8","author":"Bollob\u00e1s","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB5","article-title":"Bandwidth versus bandsize","author":"Erdos","year":"1985","journal-title":"Graph Theory at Sandbjerg Castle \u2014 Proceedings of the Conference in Memory of Gabriel Andrew Dirac"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB6","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(91)90046-Y_BIB7","first-page":"29","article-title":"On the bandwidth of a random graph","volume":"20A","author":"Kuang","year":"1985","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(91)90046-Y_BIB8","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","article-title":"A framework for solving VLSI graph layout problems","volume":"28","author":"Leighton","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(91)90046-Y_BIB9","unstructured":"F.T. Leighton, F. Makedon and I.H. Sudborough, Simulating pyramids with hypercubes, Manuscript in preparation."},{"key":"10.1016\/0166-218X(91)90046-Y_BIB10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1017\/S0305004100059648","article-title":"Achromatic numbers of random graphs","volume":"92","author":"McDiarmid","year":"1982","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0166-218X(91)90046-Y_BIB11","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/0196-6774(85)90016-1","article-title":"NP-completeness for minimizing maximum edge length in grid embeddings","volume":"6","author":"Miller","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB12","first-page":"170","article-title":"Simulating binary trees on hypercubes","volume":"324","author":"Monien","year":"1988"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB13","series-title":"Graphical Evolution: An Introduction to the Theory of Random Graphs","author":"Palmer","year":"1985"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB14","article-title":"On embedding graphs in grids","author":"Rosenberg","year":"1979","journal-title":"IBM Res. Rept., RC 7559 (#2688)"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB15","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01776564","article-title":"Bounds on the costs of data encodings","volume":"12","author":"Rosenberg","year":"1978","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0166-218X(91)90046-Y_BIB16","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0215041","article-title":"On the probable performance of heuristics for bandwidth minimization","volume":"15","author":"Turner","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(91)90046-Y_BIB17","first-page":"633","article-title":"On the bandwidth of random graphs","volume":"17","author":"de la Vega","year":"1983"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190046Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9190046Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:11Z","timestamp":1555135091000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9190046Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":17,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["0166218X9190046Y"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(91)90046-y","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}