The problem of edge disjoint path routing arises from applications in distributed memory parallel computing. We examine this problem in both the directed hypercube and two-dimensional grid topologies. Complexity results are obtained for these problems where the routing must consist entirely of shortest length paths. Additionally, approximation algorithms are presented for the case when the routing request is of a special form known as a permutation. Permutations simply require that no vertex in the graph may be used more than once as either a source or target for a routing request. Szymanski conjectured that permutations are always routable in the directed hypercube, and this remains an open problem
AbstractWe introduce a concept of so-called disjoint ordering for any collection of finite sets. It ...
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an...
This paper introduces a new concept called routing functions, which have a close relation to one-to-...
The problem of edge disjoint path routing arises from applications in distributed memory parallel co...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...
For each d <= 8 we provide an oblivious algorithm for routing any permutation on the d-dimensional h...
In this paper we first present new proofs, much shorter and much simpler than can be found elsewhere...
We present new techniques for mapping computations onto hypercubes. Our methods speed up classical ...
We present new techniques for mapping computations onto hypercubes. Our methods speed up classical ...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
AbstractLet Hn be the directed symmetric n-dimensional hypercube. Using the computer, we show that f...
AbstractLet Hn be the directed symmetric n-dimensional hypercube. Using the computer, we show that f...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like net...
AbstractWe introduce a concept of so-called disjoint ordering for any collection of finite sets. It ...
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an...
This paper introduces a new concept called routing functions, which have a close relation to one-to-...
The problem of edge disjoint path routing arises from applications in distributed memory parallel co...
AbstractOblivious permutation routing in binary d-cubes has been well studied in the literature. In ...
For each d <= 8 we provide an oblivious algorithm for routing any permutation on the d-dimensional h...
In this paper we first present new proofs, much shorter and much simpler than can be found elsewhere...
We present new techniques for mapping computations onto hypercubes. Our methods speed up classical ...
We present new techniques for mapping computations onto hypercubes. Our methods speed up classical ...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
AbstractLet Hn be the directed symmetric n-dimensional hypercube. Using the computer, we show that f...
AbstractLet Hn be the directed symmetric n-dimensional hypercube. Using the computer, we show that f...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
This paper deals with permutation routing on hypercube networks in the store-and-forward model. We i...
Routing functions had been shown effective in constructing node-disjoint paths in hypercube-like net...
AbstractWe introduce a concept of so-called disjoint ordering for any collection of finite sets. It ...
New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an...
This paper introduces a new concept called routing functions, which have a close relation to one-to-...
Add to ORKG