✦ LIBER ✦

Balancing minimum spanning trees and shortest-path trees

✍ Scribed by S. Khuller; B. Raghavachari; N. Young

Publisher: Springer
Year: 1995
Tongue: English
Weight: 897 KB
Volume: 14
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01294129

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balancing two spanning trees

✍ Matthias Kriesell 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

A linear algorithm for analysis of minim

A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs

✍ Heather Booth; Jeffery Westbrook 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 713 KB

Some experience in distributed programmi

Some experience in distributed programming using shortest path spanning trees

✍ Johan J. Lukkien 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Shortest shortest path trees of a networ

Shortest shortest path trees of a network

✍ Pierre Hansen; Maolin Zheng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 664 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

The minimum labeling spanning trees

✍ Ruay-Shiung Chang; Leu Shing-Jiuan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 449 KB

One of the fundamental problems in graph theory is to compute a minimum weight spanning tree. In this paper, a variant of spanning trees, called the minimum labeling spanning tree, is studied. The purpose is to find a spanning tree that tries to use edges that are as similar as possible. Giving each