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.
Type de document :
Communication dans un congrès
International Workshop on Graph-Theoretic Concepts in Computer Science WG'99, Jun 1999, Ascona, Switzerland. Springer-Verlag, 1665, pp.179-190, 1999, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00649015
Contributeur : Olivier Baudon <>
Soumis le : mardi 6 décembre 2011 - 18:11:12
Dernière modification le : jeudi 5 avril 2018 - 10:36:49

Identifiants

  • HAL Id : hal-00649015, version 1

Citation

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. Springer-Verlag, 1665, pp.179-190, 1999, Lecture Notes in Computer Science. 〈hal-00649015〉

Partager

Métriques

Consultations de la notice

242