𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Parallel algorithms for the connected components and minimal spanning tree problems

✍ Scribed by Dhruva Nath; S.N. Maheshwari

Book ID
113162504
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
657 KB
Volume
14
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
✍ Ravindra K. Ahuja; James B. Orlin πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 Ε½ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre

A self-stabilizing distributed algorithm
A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
✍ G. Antonoiu; P.K. Srimani πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 640 KB

Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove i