Research Note
Routing a Permutation in the Hypercube by Two Sets of Edge Disjoint Paths

https://doi.org/10.1006/jpdc.1997.1358Get rights and content

Abstract

Consider a hypercube regarded as a directed graph, with one edge in each direction between each pair of adjacent nodes. We show that any permutation on the hypercube can be partitioned into two partial permutations of the same size so that each of them can be routed by edge-disjoint directed paths. This result implies that the hypercube can be made rearrangeable by virtually duplicating each edge through time-sharing (or through the use of two wavelengths in the case of optical connection), rather than by physically adding edges as in previous approaches. When our goal is to route as many source–destination pairs of the given permutation as possible by edge-disjoint paths, our result gives a 2-approximate solution which improves previous ones.

References (18)

There are more references available in the full text version of this article.

Cited by (24)

  • 2-1 routing requests in the hypercube

    2005, Electronic Notes in Discrete Mathematics
  • Optimal broadcasting in injured hypercubes using directed safety levels

    2003, Journal of Parallel and Distributed Computing
  • The permutation-path coloring problem on trees

    2003, Theoretical Computer Science
View all citing articles on Scopus

This work was partially supported by the Founding of Group Research Projects at The University of Aizu.

2

E-mail: [email protected].

3

E-mail: [email protected]

View full text