Connectivity of kautz networks
暂无分享,去创建一个
Jean-Claude Bermond | Claudine Peyrat | Nathalie Homobono | J. Bermond | Nathalie Homobono | C. Peyrat
[1] Makoto Imase,et al. A Design for Directed Graphs with Minimum Diameter , 1983, IEEE Transactions on Computers.
[2] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[3] Charles Delorme,et al. Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..
[4] Makoto Imase,et al. Connectivity of Regular Directed Graphs with Small Diameters , 1985, IEEE Transactions on Computers.
[5] W. Daniel Hillis,et al. The connection machine , 1985 .
[6] Sudhakar M. Reddy,et al. A Class of Graphs for Fault-Tolerant Processor Interconnections , 1984, ICDCS.
[7] Jean-Claude Bermond,et al. Large fault-tolerant interconnection networks , 1989, Graphs Comb..
[8] S. Louis Hakimi,et al. Fault-Tolerant Routing in DeBruijn Comrnunication Networks , 1985, IEEE Transactions on Computers.
[9] Claude Kaiser,et al. Distributed computing systems , 1986 .
[10] Miguel Angel Fiol,et al. Line Digraph Iterations and the (d, k) Digraph Problem , 1984, IEEE Transactions on Computers.