✦ LIBER ✦

Minimum spanning trees in networks with varying edge weights

✍ Scribed by Kevin R. Hutson; Douglas R. Shier

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 432 KB
Volume: 146
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-006-0043-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Finding the most vital edge with respect

Finding the most vital edge with respect to minimum spanning tree in weighted graphs

✍ Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 557 KB

Minimal spanning trees in undirected net

Minimal spanning trees in undirected networks with exponentially distributed arc weights

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

Approximating minimum-cost graph problem

Approximating minimum-cost graph problems with spanning tree edges

✍ Michel X. Goemans; David P. Williamson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Finding thekmost vital edges with respec

Finding thekmost vital edges with respect to minimum spanning tree

✍ Hong Shen 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 157 KB

Distributed algorithms for constructing

Distributed algorithms for constructing a minimum-weight spanning tree in a broadcast network

✍ Yaron I. Gold; Shlomo Moran 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 995 KB