A Combinatorial Analysis of Distance Reliability in Star Network
暂无分享,去创建一个
[1] Hamid Sarbazi-Azad,et al. A comparative performance analysis of n-cubes and star graphs , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.
[2] Selim G. Akl,et al. On some combinatorial properties of the star graph , 2005, 8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05).
[3] Pradip K. Srimani,et al. Topological properties of star graphs , 1993 .
[4] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.
[5] Shahram Latifi. On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..
[6] Nader Bagherzadeh,et al. A Grid Embedding into the Star Graph for Image Analysis Solutions , 1996, Inf. Process. Lett..
[7] Deng-Jyi Chen,et al. The distributed program reliability analysis on star topologies , 1998, Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250).
[8] Nader Bagherzadeh,et al. Embedding an Arbitrary Binary Tree into the Star Graph , 1996, IEEE Trans. Computers.
[9] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[10] Khaled Day,et al. A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..