Graph theoretic characterization and reliability of the generalized Boolean n-cube network
暂无分享,去创建一个
[1] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .
[2] David B. Brown,et al. A Computerized Algorithm for Determining the Reliability of Redundant Configurations , 1971 .
[3] Larry D. Wittie,et al. Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.
[4] James R. Armstrong,et al. Fault Diagnosis in a Boolean n Cube Array of Microprocessors , 1981, IEEE Transactions on Computers.
[5] Howard Jay Siegel,et al. Shuffling with the Illiac and PM2I SIMD Networks , 1984, IEEE Transactions on Computers.
[6] Franco P. Preparata,et al. The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[7] Lois Wright Hawkes. A Regular Fault-Tolerant Architecture for Interconnection Networks , 1985, IEEE Transactions on Computers.
[8] Sartaj Sahni,et al. Optimal BPC Permutations on a Cube Connected SIMD Computer , 1982, IEEE Transactions on Computers.
[9] Arunabha Sen,et al. On an Optimally Fault-Tolerant Multiprocessor Network Architecture , 1987, IEEE Transactions on Computers.
[10] Yousef Saad,et al. Multigrid Algorithms on the Hypercube Multiprocessor , 1986, IEEE Transactions on Computers.
[11] Douglas Bauer,et al. Combinatorial optimization problems in the analysis and design of probabilistic networks , 1985, Networks.
[12] T. Williams. The Design of Survivable Communications Networks , 1963 .
[13] Jhing-Fa Wang,et al. The number of spanning trees of the generalized Boolean n-cube network , 1988 .
[14] Cauligi S. Raghavendra,et al. Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks , 1986, IEEE Transactions on Computers.
[15] Ding-Zhu Du,et al. Doubly Linked Ring Networks , 1985, IEEE Transactions on Computers.
[16] David A. Carlson,et al. Modified Mesh-Connected Parallel Computers , 1988, IEEE Trans. Computers.
[17] Frank Harary,et al. Graph Theory , 2016 .
[18] R. Wilkov,et al. Analysis and Design of Reliable Computer Networks , 1972, IEEE Trans. Commun..
[19] Dharma P. Agrawal,et al. Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.
[20] Jhing-Fa Wang,et al. Graph theoretic reliability analysis for the Boolean n cube networks , 1988 .
[21] J. Scott Provan,et al. The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..
[22] Mohammed Zaki,et al. Analysis of Reliability Models for Interconnecting MIMD Systems , 1988, Comput. J..
[23] Warren Dent,et al. Construction of redundant networks with minimum distance , 1970 .
[24] Claude E. Shannon,et al. Reliable Circuits Using Less Reliable Relays , 1956 .
[25] Howard P. Katseff,et al. Incomplete Hypercubes , 1988, IEEE Trans. Computers.
[26] Dhiraj K. Pradhan,et al. A Fault-Tolerant Communication Architecture for Distributed Systems , 1982, IEEE Transactions on Computers.
[27] Dhiraj K. Pradhan,et al. Fault-Tolerant Multiprocessor Link and Bus Network Architectures , 1994, IEEE Transactions on Computers.