Abstract derivation of transitive closure algorithms

Information Processing Letters

Volumn 63, Issue 3, 1997, Pages 159-164

  Feijs, L M G ^a,b   Van Ommering, R C ^a  

^a PHILIPS RESEARCH LABORATORIES   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Algorithms; Program specification; Transitive closure

Indexed keywords

MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING; VECTORS;

PROGRAM SPECIFICATION; TRANSITIVE CLOSURE; WARSHALL ALGORITHM;

ALGORITHMS;

EID: 0031207397     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00113-0     Document Type: Article

References (8)

1. S. Warshall, A theorem on Boolean matrices, J. ACM 9 (1962) 11-12.
2. R.C. Backhouse, Calculating the Floyd-Warshall path algorithm, Eindhoven University of Technology, 1992.
3. R.C. Backhouse, J.P.H.W. van den Eijnde and A.J.M. van Gasteren, Calculating path algorithms, Sci. Comput. Programming 22 (3) (1994) 3-19.
4. E. Nuutila, Efficient transitive closure computation in large digraphs, Ph.D. Thesis, Helsinki University of Technology, Espoo Finland, 1995.
5. J. Ullman and M. Yannakakis, The input/output complexity of transitive closure, in: Proc. ACM-SIGMOD 1990 Internat. Conf. on Management of Data (1990) 44-53.
6. K. Clenaghan, Dynamic algebra for calculating algorithms, in: K. Hammond, D.N. Turner and P.M. Sansom, eds., Functional Programming, Workshops in Computing (Springer, Berlin, 1994) 18-28.
7. A.J.M. van Gasteren, On the Shape of Mathematical Arguments, Lecture Notes in Computer Science, Vol. 445 (Springer, Berlin, 1990).
8. G. Schmidt and T. Ströhlein, Relations and Graphs (Springer, Berlin, 1991).