𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A transitive closure algorithm

✍ Scribed by Paul Purdom

Book ID
112656987
Publisher
Springer Netherlands
Year
1970
Tongue
English
Weight
997 KB
Volume
10
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Fully Dynamic Algorithm for Maintainin
A Fully Dynamic Algorithm for Maintaining the Transitive Closure
✍ Valerie King; Garry Sagert πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 170 KB

This paper presents an efficient fully dynamic graph algorithm for maintaining the transitive closure of a directed graph. The algorithm updates the adjacency matrix of the transitive closure with each update to the graph; hence, each reachability query of the form ''Is there a directed path from i

Algorithms for transitive closure
Algorithms for transitive closure
✍ A. KoubkovΓ‘; V. Koubek πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 105 KB

Let Οƒ (n) denote the number of all strongly connected graphs on the n-element set. We prove that Οƒ (n) ). Hence the algorithm computing a transitive closure by a reduction to acyclic graphs has the expected time O(n 2 ), under the assumption of uniform distribution of input graphs. Furthermore, we