1. An efficient algorithm for embedding exchanged hypercubes into grids [J] . Fan Weibei, Fan Jianxi, Lin Cheng-Kuan, Journal of supercomputing . 2019,第2期 机译:一种将交换的超立方体嵌入网格的有效算法 2. Embedding multidimensional grids into optimal hypercubes [J] . Zevi Miller, Dan ...
Schroeder, Embedding of hypercubes into grids, Mortar Fire Control System (1998) 693-701.S. L. Bezrukov, J. D. Chavez, L. H. Harper, M. Rottger and U. P. Schroeder, Embedding of hyper- cubes into grids, MFCS 1998, 693 - 701....
M.Y. Chan Embedding of grids into optimal hypercubes SIAM J. Computing, 20 (No. 5) (1991), pp. 834-864 CrossrefGoogle Scholar [CMST] M.-J. Chung, F. Makedon, I.H. Sudborough, J. Turner Polynomial algorithms for the min-cut linear arrangement problem on degree restricted trees SIAM...
They might be applicable to more complex grid embedding problems, such as embedding multidimensional grids into hypercubesdoi:10.1109/12.67319Ellis... Ellis,J.A. - 《Computers IEEE Transactions on》 被引量: 132发表: 1991年 Efficient Embeddings of Grids into Grids For embedding grids into grids of...
MANY TO ONE EMBEDDING FROM GRIDS INTO CYLINDERS, TORI, AND HYPERCUBES. Describes novel methods for embedding two-dimensional grid graphs into cylinders, tori and hypercubes, where the guest grid G is larger than the host graph... Ellis,John,Chow,... - 《Siam Journal on Computing》 被引量:...
We introduce new easily computable functions which embed many 3-dimensional grids into their optimal hypercubes with dilation 2. Moreover, we show that one can reduce the open problem to recognize whether it is possible to embed every 3-dimensional grid into its optimal hypercube with dilation at...
Embedding of tori and grids into twisted cubes Moreover, we also provide similar embedding results for meshes and hypercubes. Our results mean that a family of torus-structured (mesh-structured, or ... PL Lai,CH Tsai - 《Theoretical Computer Science》 被引量: 44发表: 2010年 FAULT-TOLERANT ...
In this paper, a deterministic algorithm for dynamically embedding binary trees into next to optimal hypercubes is presented. Due to a known lower bound, any such algorithm must use either randomization or migration, i.e., remapping of tree vertices, to obtain an embedding of trees into hypercub...
of processors due to its physical design, while the guest graph can grow arbitrarily large depending on the application. The results of this paper widen the class of computations that can be performed on these product graphs which are often cited as being low-cost alternatives for hypercubes. ...
This 2-dimensional problem has many applications in computer science including the simulation of one grid of processors by another of different shape. Also, it can likely be applied to more complex problems such as those involving grids of higher dimension and hypercubes. It is already known that...