Related content

Multicast in Wormhole-Switched Torus Networks Using Edge-Disjoint Spanning Trees

By Wang H.   Blough D.M.  

Journal of Parallel and Distributed Computing, Vol. 61, Iss. 9, 2001-09 ,pp. : 1278-1306

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

k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

By Emek Yuval  

Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. : 141-160

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S.   Ghosh R.K.   Reddy A.P.K.  

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

Optimal Independent Spanning Trees on Odd Graphs

By Kim Jong-Seok   Lee Hyeong-Ok   Cheng Eddie   Lipták László  

The Journal of Supercomputing, Vol. 56, Iss. 2, 2011-05 ,pp. : 212-225

Springer Publishing Company

Access to resources Recommend Favorite