{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:39:21Z","timestamp":1648881561500},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. of Comput. Sci. & Technol."],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1007\/bf02943178","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:11:13Z","timestamp":1221178273000},"page":"470-475","source":"Crossref","is-referenced-by-count":0,"title":["Mapping between 2-d meshes of the same size"],"prefix":"10.1007","volume":"12","author":[{"given":"Guoqiang","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02943178_CR1","unstructured":"Akers S B, Harel D, Krishnamurthy B. The star graph: An attractive alternative to then-cube. InInt\u2019l. Conf. Parallel Processing, 1987, pp. 393\u2013400."},{"issue":"4","key":"BF02943178_CR2","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1145\/2157.322401","volume":"30","author":"J W Hong","year":"1983","unstructured":"Hong J W, Mehlhorn K, Rosenberg A L. Cost tradeoffs in graph embeddings.J. ACM, 1983, 30(4): 709\u2013728.","journal-title":"J. ACM"},{"key":"BF02943178_CR3","unstructured":"Chen C Y R, Chung Y C. Embedding networks with ring connections in hypercube machines. InInt\u2019l. Conf. Parallel Processing, 1990, Vol. 3, pp. 327\u2013334."},{"issue":"10","key":"BF02943178_CR4","doi-asserted-by":"crossref","first-page":"1285","DOI":"10.1109\/12.5991","volume":"37","author":"M Y Chan","year":"1988","unstructured":"Chan M Y, Chin F Y L. On embedding rectangular grids in hypercubes.IEEE Trans. Computers, 1988, C-37(10): 1285\u20131288.","journal-title":"IEEE Trans. Computers"},{"key":"BF02943178_CR5","unstructured":"Chan M Y. Dilation-2 embedding of grids into hypercubes. InInt\u2019l Conf. Parallel Processing, 1988, Vol. 3, pp. 295\u2013298."},{"key":"BF02943178_CR6","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1145\/359361.359447","volume":"21","author":"R A Demillo","year":"1978","unstructured":"Demillo R A, Eisenstat S C, Lipton R J. Preserving average proximity in arrays.Commun. ACM, 1978, 21: 228\u2013231.","journal-title":"Commun. ACM"},{"key":"BF02943178_CR7","unstructured":"Ho C T, Johnsson S L. Embedding three-dimensional meshes in Boolean cubes by graph decomposition. InInt\u2019l Conf. Parallel Processing, 1990, 3: 319\u2013326."},{"key":"BF02943178_CR8","unstructured":"Ho C T, Johnsson S L. On the embedding of arbitrary meshes in Boolean cubes with expansion two dilation two. InInt\u2019l Conf. Parallel Processing, 1987, pp. 188\u2013191."},{"key":"BF02943178_CR9","unstructured":"Liu H, Huang S S. Dilation-6 embedding of 3-dimensional grids into optimal hypercubes InInt\u2019l Conf. Parallel Processing, 1991, Vol. 3, pp. 250\u2013254."},{"key":"BF02943178_CR10","unstructured":"Nigram M, Sahni S, Krishanamurthy B. Embedding hamiltonians and hypercubes in star interconnection graphs. InInt\u2019l Conf. Parallel Processing, 1990, Vol. 3, pp. 340\u2013343."},{"issue":"7","key":"BF02943178_CR11","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Schultz M H. Topological properties of hypercubes.IEEE Trans. Computers, 1988, C-37(7): 867\u2013872.","journal-title":"IEEE Trans. Computers"},{"issue":"9","key":"BF02943178_CR12","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","volume":"31","author":"R Aleliunas","year":"1982","unstructured":"Aleliunas R, Rosenberg A L. On embedding rectangular grids in square grids.IEEE Trans. Computers, 1982, C-31(9): 907\u2013913.","journal-title":"IEEE Trans. Computers"},{"key":"BF02943178_CR13","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/44483.44494","volume":"35","author":"S R Kosaraju","year":"1988","unstructured":"Kosaraju S R, Atallah M J. Optimal simulations between mesh-connected arrays of processors.J ACM, 1988, 35: 635\u2013650.","journal-title":"J ACM"},{"key":"BF02943178_CR14","doi-asserted-by":"crossref","unstructured":"Leighton F T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees and Hypercubes. Morgan Kaufmann Publishers, Inc., 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"BF02943178_CR15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","volume":"2","author":"A Y Wu","year":"1985","unstructured":"Wu A Y. Embedding of tree networks into hypercubes.J. of Parallel and Distributed Computing, 1985, 2: 238\u2013249.","journal-title":"J. of Parallel and Distributed Computing"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943178.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02943178\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02943178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:16:13Z","timestamp":1558469773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02943178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["BF02943178"],"URL":"https:\/\/doi.org\/10.1007\/bf02943178","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}