✦ LIBER ✦

A fast algorithm for the minimum spanning tree

✍ Scribed by Francis Suraweera

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 408 KB
Volume: 13
Category: Article
ISSN: 0166-3615
DOI: 10.1016/0166-3615(89)90048-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Parallel Algorithm for Computing Minim

A Parallel Algorithm for Computing Minimum Spanning Trees

✍ D.B. Johnson; P. Metaxas 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

We present a simple and implementable algorithm that computes a minimum spanning tree of an undirected weighted graph \(G=(V, E)\) of \(n=|V|\) vertices and \(m=|E|\) edges on an EREW PRAM in \(O\left(\log ^{3 / 2} n\right)\) time using \(n+m\) processors. This represents a substantial improvement i

A parallel algorithm for constructing mi

A parallel algorithm for constructing minimum spanning trees

✍ Jon Louis Bentley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 521 KB

Offline Algorithms for Dynamic Minimum S

Offline Algorithms for Dynamic Minimum Spanning Tree Problems

✍ D. Eppstein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 651 KB

We describe an efficient algorithm for maintaining a minimum spanning tree (MST) in a graph subject to a sequence of edge weight modifications. The sequence of minimum spanning trees is computed offline, after the sequence of modifications is known. The algorithm takes time \(O(k \log n)\) for a seq

A branch and bound algorithm for the cap

A branch and bound algorithm for the capacitated minimum spanning tree problem

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

The expected complexity of Prim's minimu

The expected complexity of Prim's minimum spanning tree algorithm

✍ Chip Martel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 60 KB

We study the expected performance of Prim's minimum spanning tree (MST) algorithm implemented using ordinary heaps. We show that this implementation runs in linear or almost linear expected time on a wide range of graphs. This helps to explain why Prim's algorithm often beats MST algorithms which ha

An optimal EREW PRAM algorithm for minim

An optimal EREW PRAM algorithm for minimum spanning tree verification

✍ Valerie King; Chung Keung Poon; Vijaya Ramachandran; Santanu Sinha 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 661 KB

We present a deterministic parallel algorithm on the EREW PRAM model to verify a minimum spanning tree of a graph. The algorithm runs on a graph with n vertices and m edges in O(logn) time and O(m + n) work. The algorithm is a parallelization of King's linear time sequential algorithm for the proble