Login / Signup

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

Somasundaram RavindranAlan GibbonsMike Paterson
Published in: Theor. Comput. Sci. (2000)
Keyphrases
  • binary trees
  • interconnection networks
  • edge disjoint
  • spanning tree
  • series parallel
  • multistage
  • fault tolerant
  • total length
  • decision trees
  • parallel algorithm
  • message passing
  • routing algorithm
  • binary tree