✦ LIBER ✦

Minimal spanning trees in undirected networks with exponentially distributed arc weights

✍ Scribed by V. G. Kulkarni

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 538 KB
Volume: 18
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230180204

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shortest paths in networks with exponent

Shortest paths in networks with exponentially distributed arc lengths

✍ V. G. Kulkarni 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 784 KB

On finding a minimum spanning tree in a

On finding a minimum spanning tree in a network with random weights

✍ Colin McDiarmid; Theodore Johnson; Harold S. Stone 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 2 views

We investigate Prim's standard ''tree-growing'' method for finding a minimum spanning tree, when applied to a network in which all degrees are about d and the edges e Ž . have independent identically distributed random weights w e . We find that when the kth ' Ž . edge e is added to the current tree