Abstract
The notion of transitivity, introduced in Sect. 3.1, is fundamental for orderings and equivalence relations. In Sect. 3.2 the transitive closure is defined, which is a closure operation like the ones we have encountered already in two earlier instances. We then discuss a well-known algorithm for constructing the transitive closure. Related algorithms, appropriately adapted, are widely used today as resolution procedures in logic programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
3.4 References
Bodewig E: Bericht über die verschiedenen Methoden zur Lösung eines Systems linearer Gleichungen mit reellen Koeffizienten. IV. Nederl. Akad. Wetensch. Proc Ser A 51 (1948) 53–64. Also: Indag. Math. 10 (1948) 24–35.
Give’on Y: Lattice matrices. Inform. and Control 7 (1964) 477–484.
Roy B: Transitivité et connexité. C. R. Acad. Sci. Paris 249 (1959) 216.
Strassen V: Gaussian elimination is not optimal. Numer. Math. 13 (1969) 354–356.
Warshall S: A theorem on boolean matrices. J. Assoc. Comput. Mach. 9 (1962) 11–12.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidt, G., Ströhlein, T. (1993). Transitivity. In: Relations and Graphs. EATCS Monographs on Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-77968-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-77968-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-77970-1
Online ISBN: 978-3-642-77968-8
eBook Packages: Springer Book Archive