Embedding of hypercubes into grids - Bezrukov, Chavez, et al. - 1998S. L. Bezrukov, J. D. Chavez, L. H. Harper, M. Rottger and U. P. Schroeder, "Embedding of Hypercubes into Grids," Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, Brno,...
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 ...
Fan W, Fan J, Lin C K, Wang G J, Cheng B, Wang R. An efficient algorithm for embedding exchanged hypercubes into grids.The Journal of Supercomputing. doi:org/10.1007/s11227-018-2612-2. (to be appeared) Miller M, Rajan R S, Parthiban N, Rajasingh I. Minimum linear arrangement of ...
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...
Embedding of hypercubes into necklace, windmill and snake graphs 2012, Information Processing Letters Show abstract Embedding meshes into twisted-cubes 2011, Information Sciences Show abstract Embedding meshes into locally twisted cubes 2010, Information Sciences Show abstract Embedding of tori and grids int...
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...
Small congestion Embedding of graphs into hypercubes, Networks 33 - Matsubayashi, Ueno - 1999 () Citation Context ... when the host graph is a path [11, 26, 29]. There are several results on the congestion problem for various architectures such as trees into cycles [11], trees into ...
We present an algorithm to map the nodes of a 3-dimensional grid\nto the nodes of its optimal hypercube on a one-to-one basis with\ndilation at most 5Chan, M.Y.Chin, F.Chu, C.N.Mak, W.K.Systems, Man, and Cybernetics, 1999. IEEE SMC '99 Conference Proceedings...
International Parallel and Distributed Processing SymposiumChan, M.Y., Chin, F., Chu, C.N., Mak, W.K.: Dilation-5 embedding of 3-dimensional grids into hypercubes. In: Proc. of the Fifth IEEE Symposium on Parallel and Distributed Processing, pp. 285–288 (1993)...
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 H, implying a many to one embedding. Optimal embeddings with respect to dilation and load; Mapping from grids into cylinders of height at ...