✦ LIBER ✦

On random minimum length spanning trees

✍ Scribed by A. M. Frieze; C. J. H. McDiarmid

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 446 KB
Volume: 9
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02125348

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Minimum Length Spanning Trees in

Random Minimum Length Spanning Trees in Regular Graphs

✍ Andrew Beveridge; Alan Frieze; Colin McDiarmid 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 270 KB

On Minimum Edge Ranking Spanning Trees

✍ Kazuhisa Makino; Yushi Uno; Toshihide Ibaraki 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 243 KB

In this paper, we introduce the problem of computing a minimum edge ranking spanning tree (MERST); i.e., find a spanning tree of a given graph G whose edge ranking is minimum. Although the minimum edge ranking of a given tree can be computed in polynomial time, we show that problem MERST is NP-hard.

On Constructing Minimum Spanning Trees i

On Constructing Minimum Spanning Trees inRk1

✍ S. N. Bespamyatnikh 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 83 KB

On the value of a random minimum spannin

On the value of a random minimum spanning tree problem

✍ A.M. Frieze 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

Counting Minimum Weight Spanning Trees

✍ Andrei Z. Broder; Ernst W. Mayr 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 152 KB

We present an algorithm for counting the number of minimum weight spanning trees, based on the fact that the generating function for the number of spanning trees of a given graph, by weight, can be expressed as a simple determinant. For a graph with n vertices and m edges, our Ž Ž .. Ž . algorithm r