✦ 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
DOI: 10.1007/bf01073319

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized Maxwell formula for the leng

Generalized Maxwell formula for the length of a minimal tree with a given topology

✍ A. O. Ivanov; A. A. Tuzhilin 📂 Article 📅 2010 🏛 Allerton Press Inc 🌐 English ⚖ 980 KB

The minimal Laplacian spectral radius of

The minimal Laplacian spectral radius of trees with a given diameter

✍ Ruifang Liu; Zhonghua Lu; Jinlong Shu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 678 KB

The largest minimal rectilinear steiner

The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

✍ F. R. K. Chung; F. K. Hwang 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB 👁 2 views

Estimating the Cluster Tree of a Density

Estimating the Cluster Tree of a Density by Analyzing the Minimal Spanning Tree of a Sample

✍ Werner Stuetzle 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 934 KB

Ordering of the trees with a perfect mat

Ordering of the trees with a perfect matching by minimal energies

✍ Wen-Huan Wang; Li-Ying Kang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Tail bound for the minimal spanning tree

Tail bound for the minimal spanning tree of a complete graph

✍ 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