✦ LIBER ✦

Complexity of computation of a spanning tree enumeration algorithm

✍ Scribed by Jayakumar, R.; Thulasiraman, K.; Swamy, M.

Book ID: 114613633
Publisher: IEEE
Year: 1984
Weight: 1018 KB
Volume: 31
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1984.1085435

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A complete spanning tree maintenance alg

A complete spanning tree maintenance algorithm and its complexity

✍ Akinori Saitoh; Yoshihiro Tsujino; Nobuki Tokura 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 891 KB

## Abstract The spanning tree maintenance problem for an LAN model in which node processors may halt and recover is considered. An algorithm meeting the conditions that the spanning tree is an __L__‐ary complete tree and that nodes halt or recover singly is presented. The message complexity of this

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 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 minimum spanning tree algorithm with i

A minimum spanning tree algorithm with inverse-Ackermann type complexity

✍ Chazelle, Bernard 📂 Article 📅 2000 🏛 Association for Computing Machinery 🌐 English ⚖ 149 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

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