Wildcard dimensions in augmented star and bubble-sort networks
暂无分享,去创建一个
[1] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[2] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[3] Shahram Latifi. Subcube Embeddability of Folded Hypercubes , 1991, Parallel Process. Lett..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] F. Leighton,et al. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .
[6] Jehoshua Bruck,et al. Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.
[7] Pradip K. Srimani,et al. Super Star: a new optimally fault tolerant network architecture , 1991, [1991] Proceedings. 11th International Conference on Distributed Computing Systems.
[8] Sheldon B. Akers,et al. A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.
[9] Shahram Latifi. On the Fault-Diameter of the Star Graph , 1993, Inf. Process. Lett..
[10] Pradip K. Srimani. Generalized Fault Tolerance Properties of Star Graphs , 1991, ICCI.
[11] Khaled Day,et al. A Comparative Study of Topological Properties of Hypercubes and Star Graphs , 1994, IEEE Trans. Parallel Distributed Syst..
[12] Pradip K. Srimani,et al. Fault Diameter of Star Graphs , 1993, Inf. Process. Lett..
[13] Shahram Latifi,et al. On Folded Hypercubes , 1989, ICPP.
[14] Sheldon B. Akers,et al. The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.