𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A sensitive transitive closure algorithm

✍ Scribed by Jürgen Ebert

Book ID
113162305
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
451 KB
Volume
12
Category
Article
ISSN
0020-0190

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