
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M.Y. Chan, S.J. Lee, "FaultTolerant Embedding of Complete Binary Trees in Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 3, pp. 277288, March, 1993.  
BibTex  x  
@article{ 10.1109/71.210811, author = {M.Y. Chan and S.J. Lee}, title = {FaultTolerant Embedding of Complete Binary Trees in Hypercubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {4}, number = {3}, issn = {10459219}, year = {1993}, pages = {277288}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.210811}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  FaultTolerant Embedding of Complete Binary Trees in Hypercubes IS  3 SN  10459219 SP277 EP288 EPD  277288 A1  M.Y. Chan, A1  S.J. Lee, PY  1993 KW  Index Termsfault tolerant embedding; complete binary trees; hypercubes; graphtheoretic question;simulation; ktree; NPcomplete; upper bound; computational complexity; fault tolerantcomputing; hypercube networks; trees (mathematics) VL  4 JA  IEEE Transactions on Parallel and Distributed Systems ER   
The focus is on the following graphtheoretic question associated with the simulation ofcomplete binary trees by faulty hypercubes: if a certain number of nodes or links areremoved from an ncube, will an (n1)tree still exists as a subgraph? While the generalproblem of determining whether a ktree, k>n, still exists when an arbitrary number ofnodes/links are removed from the ncube is found to be NPcomplete, an upper bound isfound on how many nodes/links can be removed and an (n1)tree still be guaranteed toexist. In fact, as a corollary of this, it is found that if no more than n3 nodes/links areremoved from an (n1)subcube of the ncube, an (n1)tree is also guaranteed to exist.
[1] S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg, "Optimal simulations of tree machines," inProc. 27th Annu. Symp. Foundations Comput. Sci., 1986, pp. 274282.
[2] S. N. Bhatt and I. C. F. Ipsen, "How to embed trees in hypercubes," Tech. Rep. YALEU/DCS/RR443, Yale Univ., Dec. 1985.
[3] M. Y. Chan, F. Y. L. Chin, and C. K. Poon, "Optimal simulation of full binary trees on faulty hypercubes," inProc. 2nd Annu. Int. Symp. Algorithms, 1991.
[4] M. Y. Chan and SJ. Lee, "Distributed faulttolerant embeddings of rings in hypercubes,"J. Parallel Distributed Comput., vol. 11, pp. 6371 1991.
[5] J. Hastad, T. Leighton, and M. Newman, "Reconfiguring a hypercube in the presence of faults," inProc. 19th Annu. ACM Symp. Theory of Computing, May 1987, pp. 274284.
[6] J. Hastad, T. Leighton, and M. Newman, "Fast computation using faulty hypercubes," inProc. 21st Annu. ACM Symp. Theory Comput., May 1989, pp. 251263.
[7] F. J. Provost and R. Melhem, "Distributed fault tolerant embedding of binary trees and rings in hypercubes, " inProc. Int. Workshop Defect and Fault Tolerance in VLSI Syst., 1988, pp. 8.3.18.3.8.
[8] A. Wang, R. Cypher, and E. Mayr, "Embedding complete binary trees in faulty hypercubes," IBM Tech. Rep. RJ 7821(72203), Nov. 1990.
[9] A. Wu, "Embedding of tree networks into hypercubes,"J. Parallel Distributed Comput., vol. 2, pp. 238249 1985.