✦ LIBER ✦

Efficient determination of the transitive closure of a directed graph

✍ Scribed by Ian Munro

Book ID: 113161650
Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 524 KB
Volume: 1
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(71)90006-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The Transitive Reduction of a Directed G

The Transitive Reduction of a Directed Graph

✍ Aho, A. V.; Garey, M. R.; Ullman, J. D. 📂 Article 📅 1972 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 847 KB

On the number of edges in the transitive

On the number of edges in the transitive closure of a graph

✍ W.F. McColl; K. Noshita 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Bounding the diameter of a distance-tran

Bounding the diameter of a distance-transitive graph

✍ D.H Smith 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 268 KB

The complete closure of a graph

✍ Ralph Faudree; Odile Favaron; Evelyne Flandrin; Hao Li 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 677 KB

## Abstract We define the complete closure number cc(__G__) of a graph __G__ of order __n__ as the greatest integer __k__ ≤ __2n__ − __3__ such that the __k__th Bondy‐Chvátal closure Cl~__k__~(__G__) is complete, and give some necessary or sufficient conditions for a graph to have cc(__G__) = __k__

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