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

DOI10.1016/S0304-3975(00)00066-9zbMath0949.68175OpenAlexW2001554837MaRDI QIDQ1583538

R. Smith

Publication date: 26 October 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00066-9

zbMATH Keywords

hypercubebinary treeparallel algorithmsmeshgraph embeddingshuffle-exchange networkDe Bruijn network

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
• Dense edge-disjoint embedding of complete binary trees in the hypercube
• The balanced binary tree technique on mesh-connected computers
• An optimal routing algorithm for mesh-connected Parallel computers

This page was built for publication: Dense edge-disjoint embedding of complete binary trees in interconnection networks