Hypercube permutations routable under all dimension orderings

DOI10.1016/0020-0190(96)00109-3MaRDI QIDQ671598zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Optimal permutation routing for low-dimensional hypercubes
• scientific article; zbMATH DE number 139908
• Conflict-free routing for BPC-permutations on synchronous hypercubes

Cites work

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

Cited in

(7)

• Conflict-free routing for BPC-permutations on synchronous hypercubes
• Routing automorphisms of the hypercube
• A new routing algorithm for cyclic shifts on BRGC hypercubes
• scientific article; zbMATH DE number 139908 (Why is no real title available?)
• Cubes and Boxes Have Rupert’s Passages in Every Nontrivial Direction
• Optimal permutation routing for low-dimensional hypercubes
• The generalized folding-cube network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671598)