Efficient embeddings of ternary trees into hypercubes
暂无分享,去创建一个
[1] Francine Berman,et al. On Mapping Parallel Algorithms into Parallel Architectures , 1987, J. Parallel Distributed Comput..
[2] Susanne E. Hambrusch,et al. Load balanced tree embeddings , 1992, Parallel Comput..
[3] Francis Y. L. Chin,et al. On Embedding Rectangular Grids in Hypercubes , 1988, IEEE Trans. Computers.
[4] Arnold L. Rosenberg,et al. Work-Preserving Emulations of Fixed-Connection Networks (Extended Abstract) , 1989, STOC 1989.
[5] Susanne E. Hambrusch,et al. On the relationship between parallel computation and graph embeddings , 1989 .
[6] M. H. Schultz,et al. Topological properties of hypercubes , 1988, IEEE Trans. Computers.
[7] Weifa Liang,et al. Embedding K-ary Complete Trees into Hypercubes , 1995, J. Parallel Distributed Comput..
[8] Arnold L. Rosenberg,et al. Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[9] Ilse C. F. Ipsen,et al. How to Embed Trees in Hypercubes. , 1985 .
[10] Arnold L. Rosenberg,et al. Cost Trade-offs in Graph Embeddings, with Applications , 1983, JACM.
[11] Mikhail J. Atallah,et al. Optimal simulations between mesh-connected arrays of processors , 1988, JACM.
[12] Arnold L. Rosenberg,et al. Work-preserving emulations of fixed-connection networks , 1989, STOC '89.
[13] Arnold L. Rosenberg. GRAPH EMBEDDINGS 1988: Recent Breakthroughs, New Directions , 1988, AWOC.