✦ LIBER ✦

On computing the time complexity of transitive closure algorithms

✍ Scribed by Joël Coffy

Book ID: 113161716
Publisher: Elsevier Science
Year: 1973
Tongue: English
Weight: 513 KB
Volume: 2
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(73)90010-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On computing the transitive closure of a

On computing the transitive closure of a relation

✍ J. Eve; R. Kurki-Suonio 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 647 KB

The dynamic complexity of transitive clo

The dynamic complexity of transitive closure is in DynTC0

✍ William Hesse 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 129 KB

This paper presents a fully dynamic algorithm for maintaining the transitive closure of a binary relation. All updates and queries can be computed by constant depth threshold circuits of polynomial size (TC 0 circuits). This places dynamic transitive closure in the dynamic complexity class DynTC 0 ,

Design of optimal systolic algorithms fo

Design of optimal systolic algorithms for the transitive closure problem

✍ Sarkar, D.; Mukherjee, A. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 456 KB

On the complexity of computing the profi

On the complexity of computing the profinite closure of a rational language

✍ P.-C. Héam 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 278 KB

On the computational complexity of graph

On the computational complexity of graph closures

✍ Angelo Monti 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 375 KB

An algorithm for computing the transitiv

An algorithm for computing the transitive closure of a fuzzy similarity matrix

✍ Fu Guoyao 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 308 KB