Fault diameter of interconnection networks
From MaRDI portal
Publication:1101090
DOI10.1016/0898-1221(87)90085-XzbMath0641.94048MaRDI QIDQ1101090
Publication date: 1987
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
94C15: Applications of graph theory to circuits and networks
Related Items
Routing properties of supercubes, Comparing four classes of torus-based parallel architectures: network parameters and communication performance, Stirling networks: A versatile combinatorial topology for multiprocessor systems, On the fault-diameter of the star graph, Rabin numbers of Butterfly networks, Fault-tolerant routing in circulant networks and cycle prefix networks, Combinatorial properties of generalized hypercube graphs, The vulnerability of the diameter of folded \(n\)-cubes, On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network, Fault-tolerant algorithm for Fast Fourier Transform on hypercubes, Restricted fault diameter of hypercube networks, Topological properties of star graphs, A unified formulation of Kautz network and generalized hypercube