Congestion-free Optimal Routings of Hypercube Automorphisms

DOI10.1137/S0895480194275175MaRDI QIDQ4337731zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Routing automorphisms of the hypercube
• Almost optimal permutation routing on hypercubes
• Routing linear permutations on Fibonacci and Lucas cubes
• Congestion-free Routings of Linear Complement Permutations
• From Hall's matching theorem to optimal routing on hypercubes
• Optimal permutation routing for low-dimensional hypercubes
• Randomized routing on generalized hypercubes
• Tight bounds for oblivious routing in the hypercube
• The optimal routing of augmented cubes

Cited in

(4)

• Routing automorphisms of the hypercube
• Optimal permutation routing for low-dimensional hypercubes
• Congestion-free Routings of Linear Complement Permutations
• Routing linear permutations on Fibonacci and Lucas cubes

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

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