𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Routing permutations on a graph

✍ Scribed by Mark Ramras

Publisher
John Wiley and Sons
Year
1993
Tongue
English
Weight
645 KB
Volume
23
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On diameter of permutation graphs
On diameter of permutation graphs
✍ Gu, Weizhen πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

Let G be a connected graph with n vertices. Let a be a permutation in S n . The a-generalized graph over G, denoted by P a (G), consists of two disjoint, identical copies of G along with edges Β£a(Β£). In this paper, we investigated the relation between diameter of P a (G) and diameter of G for any pe

Routing Permutations on Hypercube Machin
Routing Permutations on Hypercube Machines with Half-Duplex Links
✍ C.S. Raghavendra; M.A. Sridhar πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 466 KB

Algorithms are presented for realizing permutations on a less restrictive hypercube model called the S-MIMD (synchronous MIMD), which allows at most one data transfer on a given communication link at a given time instant, and where data movements are not restricted to a single dimension at a given t

Deterministic Permutation Routing on Mes
Deterministic Permutation Routing on Meshes
✍ Jop F. Sibeyn; Bogdan S. Chlebus; Michael Kaufmann πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 248 KB

New deterministic algorithms for routing permutations on two-dimensional meshes are developed. On an n = n array, one algorithm runs in the optimal 2 ΠΈ n y 2 steps, with maximum queue length 32. Another algorithm runs in near-Ε½ . optimal time, 2 ΠΈ n q O O 1 steps, with a maximum queue length of only