Some permutation routing algorithms for low-dimensional hypercubes

DOI10.1016/S0304-3975(00)00279-6zbMath0992.68154OpenAlexW1972824606MaRDI QIDQ5958304

No author found.

Publication date: 3 March 2002

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

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

zbMATH Keywords

hypercubepermutation routingdestination graphoblivious routing

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05)

Related Items (1)

Optimal permutation routing for low-dimensional hypercubes

Cites Work

• Unnamed Item
• A \(d\)-move local permutation routing for the \(d\)-cube
• Routing, merging, and sorting on parallel models of computation
• Comments on the oblivious routing algorithm of Kaklamanis, Krizanc, and Tsantilas in the hypercube
• Tight bounds for oblivious routing in the hypercube
• A Scheme for Fast Parallel Communication
• How much can hardware help routing?

This page was built for publication: Some permutation routing algorithms for low-dimensional hypercubes