✦ LIBER ✦

Efficient computation of transitive closures

✍ Scribed by H. Legind Larsen; R.R. Yager

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 462 KB
Volume: 38
Category: Article
ISSN: 0165-0114
DOI: 10.1016/0165-0114(90)90101-b

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

Computational experiences with some tran

Computational experiences with some transitive closure algorithms

✍ M. M. Sysło; J. Dzikiewicz 📂 Article 📅 1975 🏛 Springer Vienna 🌐 English ⚖ 387 KB

Transitive approximation of fuzzy relati

Transitive approximation of fuzzy relations by alternating closures and openings

✍ B. De Baets; H. De Meyer 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 149 KB

Divisorial Extensions and the Computatio

Divisorial Extensions and the Computation of Integral Closures

✍ Wolmer V. Vasconcelos 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 253 KB

We provide a setting for analyzing the efficiency of algorithms that compute the integral closure of affine rings. It gives quadratic (cubic in the non-homogeneous case) multiplicity-based but dimension-independent bounds for the number of passes the basic construction will make. An approach that do

An efficient parallel algorithm for the

An efficient parallel algorithm for the transitive closure of a graph

✍ P. Fraisse 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 377 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