✦ LIBER ✦

On computing graph closures

✍ Scribed by Samir Khuller

Book ID: 113163378
Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 644 KB
Volume: 31
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(89)90082-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 the computational complexity of graph

On the computational complexity of graph closures

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

On-line computation of transitive closur

On-line computation of transitive closures of graphs

✍ T. Ibaraki; N. Katoh 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Computing Local Integral Closures

✍ Emmanuel Hallouin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 409 KB

Let A be a discrete valuation ring. We give a new approach to the round4 algorithm which permits the computation of the integral closure of A in a finite separable field extension of its field of fractions.

A note on K4-closures in hamiltonian gra

A note on K4-closures in hamiltonian graph theory

✍ H.J. Broersma 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 310 KB

A note on the computation of the k-closu

A note on the computation of the k-closure of a graph

✍ Jayme Luiz Szwarcfiter 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 139 KB