Munro, Ian Efficient determination of the transitive closure of a directed graph. (English) Zbl 0221.68030 Inf. Process. Lett. 1, 56-58 (1971). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 44 Documents MSC: 68P05 Data structures 68R10 Graph theory (including graph drawing) in computer science × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Warshall, S., A Theorem on Boolean Matrices, JACM, 9, 11-12 (1962) · Zbl 0118.33104 [2] Purdom, P. W., A Transitive Closure Algorithm, (Computer Sciences Technical Report #33 (July 1968), University of Wisconsin) · Zbl 0193.14604 [3] M. Fischer and A. Meyer, private correspondence.; M. Fischer and A. Meyer, private correspondence. [4] Atlazarov, V. L., On Efficient Construction of Transitive Closure of Directed Graphs, Soviet Mathematics-Doklady, Vol. 11, No. 5, 1209-1210 (Sept. - Oct. 1970) · Zbl 0214.23601 [5] Strassen, V., Gaussian Elimination is not Optimal, Numerische Mathematique, 13 (1969) · Zbl 0185.40101 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.