Robust bounded-degree networks with small diameters
- 1 June 1992
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 247-256
- https://doi.org/10.1145/140901.141866
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Efficient self-embedding of butterfly networks with random faultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Coding theory, hypercube embeddings, and fault tolerancePublished by Association for Computing Machinery (ACM) ,1991
- A unified approach to off-line permutation routing on parallel networksPublished by Association for Computing Machinery (ACM) ,1990
- On the computational equivalence of hypercube-derived networksPublished by Association for Computing Machinery (ACM) ,1990
- Running algorithms efficiently on faulty hypercubesPublished by Association for Computing Machinery (ACM) ,1990
- Fault tolerance in hypercube-derivative networksPublished by Association for Computing Machinery (ACM) ,1989
- Fast computation using faulty hypercubesPublished by Association for Computing Machinery (ACM) ,1989
- Expanders might be practical: fast algorithms for routing around faults on multibutterfliesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981