Optimal Embedding of Complete Binary Trees into Lines and Grid

Author： Heckmann R.   Klasing R.   Monien B.   Unger W.  

Publisher： Academic Press

ISSN： 0743-7315

Source： Journal of Parallel and Distributed Computing, Vol.49, Iss.1, 1998-02, pp. : 40-56

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

Optimal Dynamic Embeddings of Complete Binary Trees into Hypercubes

By Heun V.   Mayr E.W.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 8, 2001-08 ,pp. : 1110-1125

Academic Press

Access to resources Recommend Favorite

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

Dense edge-disjoint embedding of complete binary trees in interconnection networks

By Ravindran S.   Gibbons A.M.   Paterson M.S.  

Theoretical Computer Science, Vol. 249, Iss. 2, 2000-10 ,pp. : 325-342

Elsevier

Access to resources Recommend Favorite

Optimal dimension-exchange token distribution on complete binary trees

By Houle M.E.   Tempero E.   Turner G.  

Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. : 363-376

Elsevier

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite