✦ LIBER ✦

Spanning trees with minimum weighted degrees

✍ Scribed by Mohammad Ghodsi; Hamid Mahini; Kian Mirjalali; Shayan Oveis Gharan; Amin S. Sayedi R.; Morteza Zadimoghaddam

Book ID: 108153532
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 122 KB
Volume: 104
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.06.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Low-degree minimum spanning trees

✍ G. Robins; J. S. Salowe 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 779 KB

Degree-constrained minimum spanning tree

✍ Subhash C. Narula; Cesar A. Ho 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 868 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

Spanning trees with bounded degrees

✍ Victor Neumann-Lara; Eduardo Rivera-Campo 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 276 KB

Average distance, minimum degree, and sp

Average distance, minimum degree, and spanning trees

✍ Dankelmann, Peter; Entringer, Roger 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 218 KB

The average distance µ(G) of a connected graph G of order n is the average of the distances between all pairs of vertices of G, i.e., µ(G) = ( n 2 ) -1 {x,y}⊂V (G) d G (x, y), where V (G) denotes the vertex set of G and d G (x, y) is the distance between x and y. We prove that every connected graph

Minimum spanning trees in networks with

Minimum spanning trees in networks with varying edge weights

✍ Kevin R. Hutson; Douglas R. Shier 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 432 KB