Tolerating faults in hypercubes using subcube partitioning
- 1 May 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 41 (5) , 599-605
- https://doi.org/10.1109/12.142686
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Running algorithms efficiently on faulty hypercubesPublished by Association for Computing Machinery (ACM) ,1990
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- 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
- How robust is the n-cube?Information and Computation, 1988
- A new look at fault-tolerant network routingInformation and Computation, 1987
- On a problem of Yuzvinsky on separating the n-cubeDiscrete Mathematics, 1986
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981