{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:25Z","timestamp":1757629525202,"version":"3.44.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1016\/0743-7315(90)90131-8","type":"journal-article","created":{"date-parts":[[2004,5,11]],"date-time":"2004-05-11T07:49:26Z","timestamp":1084261766000},"page":"325-339","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"title":["Embedding meshes in Boolean cubes by graph decomposition"],"prefix":"10.1016","volume":"8","author":[{"given":"Ching-Tien","family":"Ho","sequence":"first","affiliation":[]},{"given":"S.Lennart","family":"Johnsson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/0743-7315(90)90131-8_BIB1","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1109\/TC.1982.1676109","article-title":"On embedding rectangular grids in square grids","volume":"31","author":"Aleliunas","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(90)90131-8_BIB2","series-title":"Proc. '88 AWOC: VLSI, Algorithms and Architectures Conference","article-title":"Embedding grids into hypercubes","volume":"Vol. 319","author":"Bettayeb","year":"1988"},{"article-title":"Embeddings of communication trees and grids into hypercubes","year":"1985","author":"Brandenburg","key":"10.1016\/0743-7315(90)90131-8_BIB3"},{"key":"10.1016\/0743-7315(90)90131-8_BIB4","series-title":"1988 International Conference on Parallel Processing","article-title":"Dilation-2 embeddings of grids into hypercubes","author":"Chan","year":"1988"},{"key":"10.1016\/0743-7315(90)90131-8_BIB5","series-title":"Tech. Rep.","article-title":"The embedding of grids into optimal hypercubes","author":"Chan","year":"1988"},{"key":"10.1016\/0743-7315(90)90131-8_BIB6_1","series-title":"Tech. Rep.","article-title":"Embeddings of 3-dimensional grids into optimal hypercubes","author":"Chan","year":"1988"},{"year":"1989","series-title":"Proc. Fourth Conference on Hypercubes, Concurrent Computers, and Applications","author":"Chan","key":"10.1016\/0743-7315(90)90131-8_BIB6_2"},{"article-title":"On embedding rectangular grids","year":"1987","author":"Chan","key":"10.1016\/0743-7315(90)90131-8_BIB7"},{"key":"10.1016\/0743-7315(90)90131-8_BIB8","unstructured":"Chan, T. Personal communication, 1986."},{"key":"10.1016\/0743-7315(90)90131-8_BIB9_1","series-title":"Tech. Rep.","article-title":"Simulations using the hypercube graph","author":"Graham","year":"1989"},{"year":"1989","series-title":"Proc. Fourth Conference on Hypercubes, Concurrent Computers, and Applications","key":"10.1016\/0743-7315(90)90131-8_BIB9_2"},{"article-title":"Minimum expansion embeddings of meshes in hypercubes","year":"1987","author":"Greenberg","key":"10.1016\/0743-7315(90)90131-8_BIB10"},{"key":"10.1016\/0743-7315(90)90131-8_BIB11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.21136\/CMJ.1972.101102","article-title":"B-valuations of graphs","volume":"22","author":"Havel","year":"1972","journal-title":"Czech. Math. J."},{"key":"10.1016\/0743-7315(90)90131-8_BIB12","series-title":"1987 International Conference on Parallel Processing","first-page":"188","article-title":"On the embedding of arbitrary meshes in Boolean cubes with expansion two dilation two","author":"Ho","year":"1987"},{"key":"10.1016\/0743-7315(90)90131-8_BIB13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","volume":"4","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distributed Comput."},{"article-title":"Solutionset for AMA\/CS 146","year":"1983","author":"Johnsson","key":"10.1016\/0743-7315(90)90131-8_BIB14"},{"key":"10.1016\/0743-7315(90)90131-8_BIB15_1","series-title":"Tech. Rep.","article-title":"Optimal simulations between mesh-connected arrays of processors","author":"Kosaraju","year":"1986"},{"key":"10.1016\/0743-7315(90)90131-8_BIB15_2","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/44483.44494","author":"Kosaraju","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(90)90131-8_BIB16","series-title":"Tech. Rep.","article-title":"Placement of the processors of a hypercube","author":"Lai","year":"1989"},{"key":"10.1016\/0743-7315(90)90131-8_BIB17","series-title":"Proc. 21st IEEE Symp. Foundations Comput. Sci.","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/0743-7315(90)90131-8_BIB18","series-title":"Proc. Sixth International Conference on Mathematical Modelling","first-page":"222","article-title":"Embeddings in hypercubes","author":"Livingston","year":"1988"},{"key":"10.1016\/0743-7315(90)90131-8_BIB19","series-title":"1987 International Conference on Parallel Processing","first-page":"178","article-title":"Embeddings among toruses and meshes","author":"Ma","year":"1987"},{"year":"1977","series-title":"Combinatorial Algorithms","author":"Reingold","key":"10.1016\/0743-7315(90)90131-8_BIB20"},{"key":"10.1016\/0743-7315(90)90131-8_BIB21","series-title":"Tech. Rep.","article-title":"Embeddings on a Bollean cube","author":"Zubair","year":"1989"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590901318?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731590901318?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:31:48Z","timestamp":1757514708000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731590901318"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["0743731590901318"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90131-8","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Embedding meshes in Boolean cubes by graph decomposition","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(90)90131-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}