Embedding of Binomial Trees in Hypercubes with Link Faults

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.54, Iss.1, 1998-10, pp. : 59-74

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Embedding Large Complete Binary Trees in Hypercubes with Load Balancing

By Efe K.

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 1, 1996-05 ,pp. : 104-109

Academic Press

Access to resources Recommend Favorite

Effective Utilization of Hypercubes in the Presence of Faults

By Lin G. Tzeng N.F.

Journal of Parallel and Distributed Computing, Vol. 32, Iss. 2, 1996-02 ,pp. : 223-231

Academic Press

Access to resources Recommend Favorite

Efficient embeddings of ternary trees into hypercubes

By Gupta A.K. Nelson D. Wang H.

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 6, 2003-06 ,pp. : 619-629

Elsevier

Access to resources Recommend Favorite

Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes

By Chan M.Y. Chin F. Chu C.N. Mak W.K.

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 1, 1996-02 ,pp. : 98-106

Academic Press

Access to resources Recommend Favorite

Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links

By Wang D.

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 4, 2001-04 ,pp. : 545-564

Academic Press

Access to resources Recommend Favorite