Congestion-free Routings of Linear Complement Permutations

DOI10.1137/S0895480196301461zbMath0908.68117OpenAlexW1990646375MaRDI QIDQ4210219

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

hypercuberoutingcongestion-free

Mathematics Subject Classification ID

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

Related Items (1)

Optimal permutation routing for low-dimensional hypercubes

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