Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs

By Lin C.-T.  

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 12, 2003-12 ,pp. : 1277-1287

Elsevier

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

Path-Based Multicast Communication in Wormhole-Routed Unidirectional Torus Networks

By Robinson D.F.   McKinley P.K.   Cheng B.H.C.  

Journal of Parallel and Distributed Computing, Vol. 45, Iss. 2, 1997-09 ,pp. : 104-121

Academic Press

Access to resources Recommend Favorite

Minimum spanning trees in networks with varying edge weights

By Hutson Kevin   Shier Douglas  

Annals of Operations Research, Vol. 146, Iss. 1, 2006-09 ,pp. : 3-18

Springer Publishing Company

Access to resources Recommend Favorite

Buffer management in wormhole-routed torus multicomputer networks

By Kotapati K.   Dandamudi S.P.  

Future Generation Computer Systems, Vol. 16, Iss. 5, 2000-03 ,pp. : 483-491

Elsevier

Access to resources Recommend Favorite