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

Minimization of the time for executing a project given by a tree

โœ Scribed by E. M. Gol'dgaber


Book ID
105059082
Publisher
Springer US
Year
1977
Tongue
English
Weight
520 KB
Volume
13
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Tail bound for the minimal spanning tree
โœ Jeong Han Kim; Sungchul Lee ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

Suppose each edge of the complete graph K n is assigned a random weight chosen independently and uniformly from the unit interval [0; 1]. A minimal spanning tree is a spanning tree of K n with the minimum weight. It is easy to show that such a tree is unique almost surely. This paper concerns the nu