Hypercube permutations routable under all dimension orderings

DOI10.1016/0020-0190(96)00109-3zbMath1023.68643OpenAlexW1971113987MaRDI QIDQ671598

Petrişor Panaite

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00109-3

zbMATH Keywords

hypercubecombinatorial problemsgreedy routingspermutation routings

Mathematics Subject Classification ID

Combinatorics in computer science (68R05)

Related Items (2)

Routing automorphisms of the hypercube ⋮ Optimal permutation routing for low-dimensional hypercubes

Cites Work

• A Self-Routing Benes Network and Parallel Permutation Algorithms
• The Indirect Binary n-Cube Microprocessor Array
• Parallel Permutations of Data: A Benes Network Control Algorithm for Frequently Used Permutations

This page was built for publication: Hypercube permutations routable under all dimension orderings