Routing multiple paths in hypercubes

DOI10.1007/BF02090404zbMath0732.68013OpenAlexW2030513507MaRDI QIDQ3358210

David S. Greenberg, Sandeep N. Bhatt

Publication date: 1991

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02090404

zbMATH Keywords

hypercuberoutingcube-connected cyclesgrid-based scientific computationsmultiple-path embeddings

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Mathematical problems of computer architecture (68M07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to emulate shared memory
• Optimal embeddings of butterfly-like graphs in the hypercube
• Fast algorithms for bit-serial routing on a hypercube
• A unified framework for off-line permutation routing in parallel networks
• Parallel hashing
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• Efficient dispersal of information for security, load balancing, and fault tolerance
• Spanning Balanced Trees in Boolean Cubes
• On Embedding Rectangular Grids in Square Grids
• Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
• Embedding the polytomic tree into the $n$-cube

This page was built for publication: Routing multiple paths in hypercubes