Routing permutations in the hypercube

Abstract : We study an n-dimensional directed symmetric hypercube Hn, in which every pair of adjacent vertices is connected by two arcs of opposite directions. Using the computer, we show that for H4 and for any permutation on its vertices, there exists a system of pairwise arc-disjoint directed paths from each vertex to its target in the permutation.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Olivier Baudon <>
Submitted on : Tuesday, December 6, 2011 - 6:11:12 PM
Last modification on : Thursday, April 5, 2018 - 10:36:49 AM


  • HAL Id : hal-00649015, version 1


Olivier Baudon, Guillaume Fertin, Ivan Havel. Routing permutations in the hypercube. International Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Jun 1999, Ascona, Switzerland. pp.179-190. ⟨hal-00649015⟩



Record views