Hamilton-connectivity and cycle-embedding of the Möbius cubes
暂无分享,去创建一个
[1] S. Lakshmivarahan,et al. Embedding of cycles and grids in star graphs , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.
[2] Vittorio Scarano,et al. Embedding Graphs onto the Supercube , 1995, IEEE Trans. Computers.
[3] Xiaola Lin,et al. Deadlock-free multicast wormhole routing in multicomputer networks , 1991, ISCA '91.
[4] P. Cull,et al. The Mobius Cubes , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.
[5] Jianxi Fan. Diagnosability of the Möbius Cubes , 1998, IEEE Trans. Parallel Distributed Syst..
[6] Khaled Day,et al. Embedding of Cycles in Arrangement Graphs , 1993, IEEE Trans. Computers.
[7] Xiaola Lin,et al. Performance Evaluation of Multicast Wormhole Routing in 2D-Mesh Multicomputers , 1991, ICPP.
[8] Arnold L. Rosenberg,et al. Cycles in Networks , 1991 .
[9] Sartaj Sahni,et al. Embedding Hamiltonians and Hypercubes in Star Interconnection Graphs , 1990, ICPP.
[10] Cauligi S. Raghavendra,et al. Resource Deadlocks and Performance of Wormhole Multicast Routing Algorithms , 1998, IEEE Trans. Parallel Distributed Syst..
[11] Xiaola Lin,et al. Deadlock-fyee multicast wormhole routing in multicomputer networks , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.
[12] P. McKinley,et al. Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers Deadlock-free Multicast Wormhole Routing in 2d Mesh Multicomputers , 1992 .
[13] Yu-Chee Tseng,et al. A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels , 1996, IEEE Trans. Parallel Distributed Syst..