Reconfiguration of Spanning Trees in Faulty Hypercubes
暂无分享,去创建一个
[1] S. Lennart Johnsson,et al. Optimum Broadcasting and Personalized Communication in Hypercubes , 1989, IEEE Trans. Computers.
[2] John N. Tsitsiklis,et al. Optimal Communication Algorithms for Hypercubes , 1991, J. Parallel Distributed Comput..
[3] Gurdip Singh,et al. Reconfiguration of spanning trees in networks in the presence of node failures , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.
[4] Kemal Efe,et al. Congestion and fault tolerance of binary tree embeddings on hypercube , 1991, [1991] Proceedings. The Fifth International Parallel Processing Symposium.
[5] Dimiter R. Avresky,et al. Reconfiguration of Faulty Hypercubes , 1994, EDCC.
[6] Cauligi S. Raghavendra,et al. Reconfiguration of binary trees in faulty hypercubes , 1993, [1993] Proceedings Seventh International Parallel Processing Symposium.
[7] Feng-Hsu Wang,et al. On Constructing Multiple Spanning Trees in a Hypercube , 1993, Inf. Process. Lett..