Routing automorphisms of the hypercube

DOI10.1016/J.IPL.2010.07.002zbMath1234.68027OpenAlexW1987181019MaRDI QIDQ407579

Maurice Tchuente, René Ndoundam, Paulin Melatagia Yonta

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

hypercubegraph algorithmsarbitrarily routableBPC permutationqueueless MIMD

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Hypercube permutations routable under all dimension orderings
• Packet routing in fixed-connection networks: A survey
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Congestion-free Optimal Routings of Hypercube Automorphisms

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