Incomplete hypercubes: Algorithms and embeddings
Authors:
- 1 November 1994
- journal article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 8 (3) , 263-294
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Fault-Tolerant Permutation Routing in HypercubesJournal of Parallel and Distributed Computing, 1993
- Hierarchical spanning trees and distributing on incomplete hypercubesParallel Computing, 1991
- Embedding meshes in Boolean cubes by graph decompositionJournal of Parallel and Distributed Computing, 1990
- Parallel graph algorithms for hypercube computersParallel Computing, 1990
- Topological properties of hypercubesIEEE Transactions on Computers, 1988
- Optimal simulations between mesh-connected arrays of processorsJournal of the ACM, 1988
- Incomplete hypercubesIEEE Transactions on Computers, 1988
- Message routing in an injured hypercube1988
- A survey of the theory of hypercube graphsComputers & Mathematics with Applications, 1988
- Cost Trade-offs in Graph Embeddings, with ApplicationsJournal of the ACM, 1983