Routing automorphisms of the hypercube

DOI10.1016/J.IPL.2010.07.002MaRDI QIDQ407579zbMATH OpenOpenAlexFDO

Authors Paulin Melatagia Yonta, Maurice Tchuente, R. Ndoundam

Publication date 27 March 2012

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

Full work available at URL https://doi.org/10.1016/j.ipl.2010.07.002

zbMATH Keywords

arbitrarily routableBPC permutationgraph algorithmshypercubequeueless MIMD

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Conflict-free routing for BPC-permutations on synchronous hypercubes
• Routing permutations on a graph
• Congestion-free Optimal Routings of Hypercube Automorphisms
• Some permutation routing algorithms for low-dimensional hypercubes
• Hypercube permutations routable under all dimension orderings

Cites work

• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Congestion-free Optimal Routings of Hypercube Automorphisms
• scientific article; zbMATH DE number 139908 (Why is no real title available?)
• Hypercube permutations routable under all dimension orderings
• Packet routing in fixed-connection networks: A survey

Cited in

(6)

• Conflict-free routing for BPC-permutations on synchronous hypercubes
• Routings for involutions of a hypercube
• Fast algorithms for bit-serial routing on a hypercube
• scientific article; zbMATH DE number 139908 (Why is no real title available?)
• scientific article; zbMATH DE number 1236493 (Why is no real title available?)
• Congestion-free Optimal Routings of Hypercube Automorphisms

This page was built for publication: Routing automorphisms of the hypercube

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