Abstract
An algorithm for transitive closure is described with expected time O(n+m*) where n is the number of nodes and m* is the expected number of edges in the transitive closure.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
Arlazarov, V.L., Dinic, E.A., Kronod, M.A., Faradzev, I.A.: On economical construction of the transitive closure of an oriented graph. Dokl. Acad.Nauk,SSSR, 11 (1970), 1209–1210
Bloniarz, Fischer, Meyer: A note on the average time to compute transitive closures. In: Automata Languages and Programming. Ed.: Michaelson and Milner, Edinburgh University Press 1976
Erdös, Spencer: Probabilistic methods in combinatorics. New York: Academic Press (1974)
Fischer, Meyer: Boolean matrix multiplication and transitive closure. Twelfth Annual IEEE. Symposium on Switching and Automata Theory, East Lansing, Michigan, 1971, 129–131
Kolmogorov, Uspenskij: On the definition of an algorithm. Uspecki mat. Nauk 13,4 3–28 (1958), English translation in: Amer.math.Soc. Transl.II Ser.29, 217–245 (1963)
Schnorr, C.P.: Rekursive Funktionen und ihre Komplexität. Teubner, Stuttgart 1974
Schönhage, A.: Universelle Turingspeicherung. In: Automatentheorie und formale Sprachen. Ed.: Dörr, Hotz. B.I. Mannheim Wien Zürich, 1970
Warshall, S.: A theorem on Boolean matrices. J. ACM 9 (1962), 11–12
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schnorr, C.P. (1977). An algorithm for transitive closure with linear expected time. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_28
Download citation
DOI: https://doi.org/10.1007/3-540-08138-0_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08138-8
Online ISBN: 978-3-540-37389-6
eBook Packages: Springer Book Archive