Deterministic Message Routing in Faulty Hypercubes

[1]  Ivan Hal Sudborough,et al.  A topological property of hypercubes: node disjoint paths , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[2]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[3]  Bruce M. Maggs,et al.  Universal packet routing algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[4]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

[5]  Danny Dolev,et al.  A New Look at Fault-Tolerant Network Routing , 1987, Inf. Comput..

[6]  Frank Thomson Leighton,et al.  Fast computation using faulty hypercubes , 1989, STOC '89.

[7]  Ivan Hal Sudborough,et al.  Disjoint Paths in the Hypercube , 1989, WG.

[8]  K. G. Shin,et al.  Message routing in an injured hypercube , 1988, C3P.

[9]  Prabhakar Raghavan.  Robust algorithms for packet routing in a mesh , 1989, SPAA '89.