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

An efficient algorithm for multiple simultaneous broadcasts in the hypercube

โœ Scribed by George D. Stamoulis; John N. Tsitsiklis

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
577 KB
Volume
46
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Algorithm for Broadcasting Mu
An Optimal Algorithm for Broadcasting Multiple Messages in Trees
โœ Krzysztof Diks; Andrzej Lingas; Andrzej Pelc ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 118 KB

We consider multiple message broadcasting in tree networks. The source (considered as the root of the tree) has k messages which have to be broadcast to all nodes of the tree. In every time unit each node can send one of its already obtained messages to one of its children. A k-message broadcasting

An Efficient Algorithm for the k-Pairwis
An Efficient Algorithm for the k-Pairwise Disjoint Paths Problem in Hypercubes
โœ Qian-Ping Gu; Shietung Peng ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 140 KB

A graph G(V, E) (|V| 2k) satisfies property A k if, given k pairs of distinct nodes (s 1 , t 1 ), ..., (s k , t k ) of V(G), there are k mutually node-disjoint paths, one connecting s i and t i for each i, 1 i k. A necessary condition for any graph to satisfy A k is that it is (2k&1)-connected. Hype