Algorithms and bounds for shortest paths and diameter in faulty hypercubes
- 1 June 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 4 (6) , 713-718
- https://doi.org/10.1109/71.242151
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Reconfiguring embedded task graphs in faulty hypercubes by automorphismsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algorithms and bounds for shortest paths and diameter in faulty hypercubesIEEE Transactions on Parallel and Distributed Systems, 1993
- Efficient histogramming on hypercube SIMD machinesComputer Vision, Graphics, and Image Processing, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Generalized measures of fault tolerance with application to N-cube networksIEEE Transactions on Computers, 1989
- Topological properties of hypercubesIEEE Transactions on Computers, 1988
- A survey of the theory of hypercube graphsComputers & Mathematics with Applications, 1988
- Fault diameter of interconnection networksComputers & Mathematics with Applications, 1987
- Optimal BPC Permutations on a Cube Connected SIMD ComputerIEEE Transactions on Computers, 1982