๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Social network coordination and graph routing

โœ Scribed by Shmuel Onn; Elisheva Sperber

Publisher
John Wiley and Sons
Year
2003
Tongue
English
Weight
128 KB
Volume
41
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Routing permutations on a graph
Routing permutations on a graph
โœ Mark Ramras ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 645 KB
Packet Routing and PRAM Emulation on Sta
Packet Routing and PRAM Emulation on Star Graphs and Leveled Networks
โœ M.A. Palis; S. Rajasekaran ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 995 KB

We consider the problem of permutation routing on a star graph, an interconnection network which has better properties than the hypercube. In particular, its degree and diameter are sublogarithmic in the network size. We present optimal randomized routing algorithms that run in \(O(\mathrm{D})\) ste

Selection, Routing, and Sorting on the S
Selection, Routing, and Sorting on the Star Graph
โœ Sanguthevar Rajasekaran; David S.L. Wei ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 270 KB

We consider the problems of selection, routing, and sorting on an n-star graph (with n! nodes), an interconnection network which has been proven to possess many special properties. We identify a tree like subgraph (which we call a "(k, 1, k) chain network") of the star graph which enables us to desi