Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes

The focus is on the following graph-theoretic question associated with the simulation of complete binary trees by faulty hypercubes: if a certain number of nodes or links are removed from an n-cube, will an (n-1)-tree still exists as a subgraph? While the general problem of determining whether a k-tree, k >

[1]  Rami Melhem,et al.  Distributed Fault Tolerant Embedding of Binary Trees and Rings in Hypercubes , 1989 .

[2]  Francis Y. L. Chin,et al.  Optimal Specified Root Embedding of Full Binary Trees in Faulty Hypercubes , 1991, ISA.

[3]  Angela Y. Wu,et al.  Embedding of tree networks into hypercubes , 1985, J. Parallel Distributed Comput..

[4]  Ernst W. Mayr,et al.  Embedding complete binary trees in faulty hypercubes , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[5]  Arnold L. Rosenberg,et al.  Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[6]  Ilse C. F. Ipsen,et al.  How to Embed Trees in Hypercubes. , 1985 .

[7]  Frank Thomson Leighton,et al.  Reconfiguring a hypercube in the presence of faults , 1987, STOC.

[8]  Mee Yee Chan,et al.  Distributed Fault-Tolerant Embeddings of Rings in Hypercubes , 1990, J. Parallel Distributed Comput..

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

[10]  Francis Y. L. Chin,et al.  Optimal Simulation of Full Binary Trees on Faulty Hypercubes , 1995, IEEE Trans. Parallel Distributed Syst..