Embedding incomplete binary trees into incomplete hypercubes
暂无分享,去创建一个
[1] Sudhakar Yalamanchili,et al. Interconnection Networks: An Engineering Approach , 2002 .
[2] Rong-Jaye Chen,et al. Compact Embedding of Binary Trees Into Hyperacubes , 1995, Inf. Process. Lett..
[3] Nian-Feng Tzeng,et al. Structural and Tree Embedding Aspects of Incomplete Hypercubes , 1994, IEEE Trans. Computers.
[4] Lionel M. Ni,et al. A survey of wormhole routing techniques in direct networks , 1993, Computer.
[5] Sajal K. Das,et al. Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.
[6] Nian-Feng Tzeng,et al. An Effective Approach t the Enhancement of Incomplete Hypercube Computers , 1992, J. Parallel Distributed Comput..
[7] Arnold L. Rosenberg,et al. Efficient Embeddings of Trees in Hypercubes* , 2022 .
[8] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[9] Howard P. Katseff,et al. Incomplete Hypercubes , 1988, IEEE Trans. Computers.
[10] F. Thomson Leighton,et al. ARRAYS AND TREES , 1992 .