✦ LIBER ✦

Parallel algorithms for minimal spanning trees of directed graphs

✍ Scribed by Yixin Zhang

Publisher: Springer
Year: 1989
Tongue: English
Weight: 570 KB
Volume: 18
Category: Article
ISSN: 1573-7640
DOI: 10.1007/bf01407899

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimal spanning trees: An empirical inv

Minimal spanning trees: An empirical investigation of parallel algorithms

✍ R.S Barr; R.V Helgaon; J.L Kennington 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 440 KB

Algorithms for updating minimal spanning

Algorithms for updating minimal spanning trees

✍ Francis Chin; David Houck 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 641 KB

An Algorithm for Enumerating All Spannin

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

✍ S. Kapoor; H. Ramesh 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 61 KB

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

Connected graphs with a minimal number o

Connected graphs with a minimal number of spanning trees

✍ N Gaffke 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 743 KB

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