乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,29]],"date-time":"2023-10-29T12:25:44Z","timestamp":1698582344738},"reference-count":23,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"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":4549,"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":[[2001,2]]},"DOI":"10.1016\/s0166-218x(00)00224-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:17:26Z","timestamp":1027606646000},"page":"143-173","source":"Crossref","is-referenced-by-count":20,"title":["Efficient embeddings of grids into grids"],"prefix":"10.1016","volume":"108","author":[{"given":"M.","family":"R\u00f6ttger","sequence":"first","affiliation":[]},{"given":"U.-P.","family":"Schroeder","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0166-218X(00)00224-9_BIB1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0893-9659(95)00015-I","article-title":"Edge isoperimetric theorems for integer point arrays","volume":"8","author":"Ahlswede","year":"1995","journal-title":"Appl. Math. Lett."},{"issue":"9","key":"10.1016\/S0166-218X(00)00224-9_BIB2","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","article-title":"On embedding rectangular grids in square grids","volume":"C-31","author":"Aleliunas","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB3","unstructured":"S.L. Bezrukov, An isoperimetric problem for Manhatten lattices, in: Proceedings of the International Conference on Sets, Graphs and Numbers, 1991, pp. 2\u20133."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB4","unstructured":"S.L. Bezrukov, Isoperimetric problems in discrete spaces, in: P. Frankl, Z. F\u00fcredi, G. Katona, D. Miklos (Eds.), Extremal Problems for Finite Sets, Bolyai Society Mathematical Studies, Vol. 3, J\u00e1nos Bolyai Mathematical Society, Budapest, 1994, pp. 59\u201391."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","article-title":"The congestion of n-cube layout on a rectangular grid","volume":"213","author":"Bezrukov","year":"2000","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB6","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0097-3165(91)90021-8","article-title":"Compressions and isoperimetric inequalities","volume":"A-56","author":"Bollob\u00e1s","year":"1991","journal-title":"J. Combin. Theory"},{"issue":"5","key":"10.1016\/S0166-218X(00)00224-9_BIB7","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1137\/0220052","article-title":"Embedding of grids into optimal hypercubes","volume":"20","author":"Chan","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB8","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0012-365X(75)90039-4","article-title":"Optimal labelling of a product of two paths","volume":"11","author":"Chv\u00e1talov\u00e1","year":"1975","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/S0166-218X(00)00224-9_BIB9","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/12.67319","article-title":"Embedding rectangular grids into square grids","volume":"40","author":"Ellis","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1097-0037(199601)27:1<1::AID-NET1>3.0.CO;2-Q","article-title":"Embedding grids into grids: techniques for large compression ratios","volume":"27","author":"Ellis","year":"1996","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0166-218X(00)00224-9_BIB11","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1142\/S0129626498000535","article-title":"Addendum to embedding grids into grids: dilation four suffices","volume":"8","author":"Ellis","year":"1998","journal-title":"Parallel Process. Lett."},{"issue":"2","key":"10.1016\/S0166-218X(00)00224-9_BIB12","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1142\/S0129626498000250","article-title":"Embedding grids into grids: dilation four suffices","volume":"8","author":"Ellis","year":"1998","journal-title":"Parallel Process. Lett."},{"issue":"3","key":"10.1016\/S0166-218X(00)00224-9_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","article-title":"Optimal numberings and isoperimetric problems on graphs","volume":"1","author":"Harper","year":"1966","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0166-218X(00)00224-9_BIB14","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01940645","article-title":"A new combinatorial approach to optimal embeddings of rectangles","volume":"16","author":"Huang","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00224-9_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0020-0190(97)00114-2","article-title":"On embedding rectangular meshes into rectangular meshes of smaller aspect ratio","volume":"63","author":"Huang","year":"1997","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"10.1016\/S0166-218X(00)00224-9_BIB16","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/44483.44494","article-title":"Optimal simulations between mesh-connected arrays of processors","volume":"35","author":"Kosaraju","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB17","doi-asserted-by":"crossref","unstructured":"C.L. Leiserson, Area-efficient graph layouts (for VLSI), in: Proceedings of the 21st Annual Symposium on Foundations of Computer Science, IEEE, Syracuse, New York, 1980, pp. 270\u2013281.","DOI":"10.1109\/SFCS.1980.13"},{"issue":"12","key":"10.1016\/S0166-218X(00)00224-9_BIB18","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1109\/12.61064","article-title":"Embedding rectangular grids into square grids with dilation two","volume":"39","author":"Melhem","year":"1990","journal-title":"IEEE Transact. Comput."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB19","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/978-3-7091-9076-0_13","article-title":"Embedding one interconnection network in another","volume":"7","author":"Monien","year":"1990","journal-title":"Comput. Suppl."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB20","series-title":"Proceedings of the EURO-PAR\u201995, Parallel Processing","first-page":"181","article-title":"On efficient embeddings of grids into grids in PARIX","volume":"Vol. 966","author":"R\u00f6mke","year":"1995"},{"issue":"2","key":"10.1016\/S0166-218X(00)00224-9_BIB21","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1142\/S0129626498000249","article-title":"Embedding 2-dimensional grids into optimal hypercubes with edge-congestion 1 or 2","volume":"8","author":"R\u00f6ttger","year":"1998","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0166-218X(00)00224-9_BIB22","doi-asserted-by":"crossref","unstructured":"F.C. Sang, I.H. Sudborough, Embedding large meshes into small ones, in: Proceedings of the IEEE Symposium on Circuits and Systems, Vol. 1, 1990, pp. 323\u2013326.","DOI":"10.1109\/ISCAS.1990.112028"},{"issue":"8","key":"10.1016\/S0166-218X(00)00224-9_BIB23","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1109\/12.609277","article-title":"On embedding between 2D meshes of the same size","volume":"46","author":"Shen","year":"1997","journal-title":"IEEE Trans. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002249?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002249?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T15:10:11Z","timestamp":1579014611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0166218X00002249"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00224-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}