2-1 routing requests in the hypercube

DOI10.1016/J.ENDM.2005.06.087zbMath1200.68059OpenAlexW2005495571MaRDI QIDQ3439394

Olivier Baudon

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2005.06.087

zbMATH Keywords

hypercubesSzymanski's conjecturerouting permutations2-1 routing requests

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Cites Work

• Routing a permutation in the hypercube by two sets of edge disjoint paths
• Routing permutations and 2-1 routing requests in the hypercube

This page was built for publication: 2-1 routing requests in the hypercube