✦ LIBER ✦

On-line computation of transitive closures of graphs

✍ Scribed by T. Ibaraki; N. Katoh

Book ID: 113162537
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 234 KB
Volume: 16
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(83)90033-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient computation of transitive clos

Efficient computation of transitive closures

✍ H. Legind Larsen; R.R. Yager 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 462 KB

On computing graph closures

✍ Samir Khuller 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 644 KB

On the Power of Deterministic Transitive

On the Power of Deterministic Transitive Closures

✍ E. Gradel; G.L. Mccolm 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 565 KB

On the computational complexity of graph

On the computational complexity of graph closures

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

A note on computing graph closures

✍ Jeremy P. Spinrad 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 153 KB

This note shows that the k-closure of a graph can be computed in time proportional to the size of the output, improving on previous O(n 3 ) algorithms.

On a class of distance transitive graphs

✍ K.S Vijayan 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 252 KB