Congestion-free Routings of Linear Complement Permutations

DOI10.1137/S0895480196301461MaRDI QIDQ4210219zbMATH OpenOpenAlexFDO

Authors Mark Ramras

Publication date 21 September 1998

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

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

zbMATH Keywords

congestion-freehypercuberouting

Mathematics Subject Classification ID

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

Recommendations

• Routing linear permutations on Fibonacci and Lucas cubes
• Congestion-free Optimal Routings of Hypercube Automorphisms
• Almost optimal permutation routing on hypercubes
• Optimal permutation routing for low-dimensional hypercubes
• Routing with congestion in acyclic digraphs
• scientific article; zbMATH DE number 6851840
• scientific article; zbMATH DE number 1202980
• Routing in undirected graphs with constant congestion
• Routing in undirected graphs with constant congestion

Cited in

(4)

• Routing linear permutations on Fibonacci and Lucas cubes
• Optimal permutation routing for low-dimensional hypercubes
• Congestion-free Optimal Routings of Hypercube Automorphisms
• scientific article; zbMATH DE number 6851840 (Why is no real title available?)

This page was built for publication: Congestion-free Routings of Linear Complement Permutations

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