Routing automorphisms of the hypercube

DOI10.1016/J.IPL.2010.07.002zbMATH Open1234.68027OpenAlexW1987181019MaRDI QIDQ407579FDOQ407579

Maurice Tchuente, R. 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

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

zbMATH Keywords

hypercubegraph algorithmsarbitrarily routableBPC permutationqueueless MIMD

Mathematics Subject Classification ID

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

Cites Work

• Packet routing in fixed-connection networks: A survey
• A Self-Routing Benes Network and Parallel Permutation Algorithms
• Title not available (Why is that?)
• Congestion-free Optimal Routings of Hypercube Automorphisms
• Hypercube permutations routable under all dimension orderings

Cited In (4)

• Title not available (Why is that?)
• Routings for involutions of a hypercube
• Conflict-free routing for BPC-permutations on synchronous hypercubes
• 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)