Congestion-free Optimal Routings of Hypercube Automorphisms

DOI10.1137/S0895480194275175zbMath0867.05064OpenAlexW2060150937MaRDI QIDQ4337731

Mark Ramras

Publication date: 26 May 1997

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194275175

zbMATH Keywords

hypercubeautomorphismroutingBPC permutation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

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

This page was built for publication: Congestion-free Optimal Routings of Hypercube Automorphisms