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

Optimal network-flow-distribution algorithms

โœ Scribed by B. N. Pshenichnyi; E. E. Kirik


Book ID
105082106
Publisher
Springer US
Year
1994
Tongue
English
Weight
638 KB
Volume
29
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Optimal Communication Algorithms in Dist
โœ R.K. Das; B.P. Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.

Network flow analysis algorithms
โœ Luke G. Latham II ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB