✦ LIBER ✦

On the worst case of a minimal spanning tree algorithm for euclidean space

✍ Scribed by Jyrki Katajainen

Publisher: Springer Netherlands
Year: 1983
Tongue: English
Weight: 385 KB
Volume: 23
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01937321

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An alternative for the implementation of

An alternative for the implementation of Kruskal's minimal spanning tree algorithm

✍ Jyrki Katajainen; Olli Nevalainen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 784 KB

Worst-case behavior of the MVCA heuristi

Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem

✍ Yupei Xiong; Bruce Golden; Edward Wasil 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 185 KB

In this paper, we review recent work on the minimum labeling spanning tree problem and obtain a new worst-case ratio for the MVCA heuristic. We also present a family of graphs in which the worst-case ratio can be attained. This implies that the new ratio cannot be improved any further.

Tail bound for the minimal spanning tree

Tail bound for the minimal spanning tree of a complete graph

✍ Jeong Han Kim; Sungchul Lee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 202 KB

Suppose each edge of the complete graph K n is assigned a random weight chosen independently and uniformly from the unit interval [0; 1]. A minimal spanning tree is a spanning tree of K n with the minimum weight. It is easy to show that such a tree is unique almost surely. This paper concerns the nu

Minimal spanning trees with a constraint

Minimal spanning trees with a constraint on the number of leaves

✍ Lucinda Matos Fernandes; Luis Gouveia 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 845 KB

On the worst case of three algorithms fo

On the worst case of three algorithms for computing the Jacobi symbol

✍ Jeffrey Shallit 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 803 KB

We study the worst-case behavior of three iterative algorithms for computing the Jacobi symbol (~). Each algorithm is similar in format to the Euclidean algorithm for computing gcd(u, v). Eisenstein's algorithm chooses an even quotient at each step. It is shown that the worst case occurs when u = 2

A parallel algorithm for the enumeration

A parallel algorithm for the enumeration of the spanning trees of a graph

✍ Shao-Wen Mai; D.J. Evans 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 450 KB

As is well known, the strategy of divide-and-conquer is widely used in problem solving. The method of partitioning is also a fundamental strategy for the design of a parallel algorithm. The problem of enumerating the spanning trees of a graph arises in several contexts such as computer-aided design