Large fault-tolerant interconnection networks
- 1 December 1989
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 5 (1) , 107-123
- https://doi.org/10.1007/bf01788663
Abstract
No abstract availableKeywords
This publication has 56 references indexed in Scilit:
- On Group Graphs and Their Fault ToleranceIEEE Transactions on Computers, 1987
- Strategies for interconnection networks: Some methods from graph theoryJournal of Parallel and Distributed Computing, 1986
- Optimal simulations of tree machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Diameters of communication networksProceedings of Symposia in Applied Mathematics, 1986
- Reliable circulant networks with minimum transmission delayIEEE Transactions on Circuits and Systems, 1985
- On the Connectivity of Cayley DigraphsEuropean Journal of Combinatorics, 1984
- Circulants and their connectivitiesJournal of Graph Theory, 1984
- Counterexamples to theorems of Menger type for the diameterDiscrete Mathematics, 1983
- On the Connectivity of Some Telecommunications NetworksIEEE Transactions on Computers, 1983
- A Combinatorial Problem Related to Multimodule Memory OrganizationsJournal of the ACM, 1974