Hexagonal and Pruned Torus Networks as Cayley Graphs
暂无分享,去创建一个
[1] Wenjun Xiao,et al. Some mathematical properties of cayley digraphs with applications to interconnection network design , 2005, Int. J. Comput. Math..
[2] Ivan Stojmenovic,et al. Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..
[3] Norman Biggs. Algebraic Graph Theory: Index , 1974 .
[4] Behrooz Parhami. Introduction to Parallel Processing , 2002, Series in Computer Science.
[5] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[6] Ivan Stojmenovic,et al. Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..
[7] Arnold L. Rosenberg,et al. Group Action Graphs and Parallel Architectures , 1990, SIAM J. Comput..
[8] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[9] Marie-Claude Heydemann,et al. Cayley graphs and interconnection networks , 1997 .
[10] Behrooz Parhami,et al. A Unified Formulation of Honeycomb and Diamond Networks , 2001, IEEE Trans. Parallel Distributed Syst..
[11] Behrooz Parhami,et al. Pruned Three-Dimensional Toroidal Networks , 1998, Inf. Process. Lett..
[12] Behrooz Parhami,et al. Introduction to Parallel Processing: Algorithms and Architectures , 1999 .