Deriving a class of layer-oriented graph algorithms

Science of Computer Programming

Volumn 26, Issue 1-3, 1996, Pages 117-132

  Russling, Martin ^a  

^a UNIVERSITY OF AUGSBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER HARDWARE DESCRIPTION LANGUAGES; COMPUTER PROGRAMMING; FORMAL LANGUAGES; GRAPH THEORY;

ALGORITHMIC GRAPH THEORY; LAYER ORIENTED GRAPH ALGORITHMS;

ALGORITHMS;

EID: 0030144756     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6423(95)00030-5     Document Type: Article

References (27)

1. R.C. Backhouse and A.J.M. van Gasteren, Calculating a path algorithm, in: R.S. Bird, C. Morgan and J. Woodcock, eds., Proc. 2nd Internat. Conf. on the Mathematics of Program Construction, Oxford, UK, 29 June-3 July 1992, Lecture Notes in Computer Science, Vol. 669 (Springer, Berlin, 1993); Extended version (together with J.P.H.W. van den Eijnde): Sci. Comput. Programming 22 (1994) 3-19.
2. R.C. Backhouse and A.J.M. van Gasteren, Calculating a path algorithm, in: R.S. Bird, C. Morgan and J. Woodcock, eds., Proc. 2nd Internat. Conf. on the Mathematics of Program Construction, Oxford, UK, 29 June-3 July 1992, Lecture Notes in Computer Science, Vol. 669 (Springer, Berlin, 1993); Extended version (together with J.P.H.W. van den Eijnde): Sci. Comput. Programming 22 (1994) 3-19.
3. R.S. Bird, The promotion and accumulation strategies in transformational programming, ACM Trans. Programming Languages Systems 6 (1984) 487-504.
4. R.S. Bird and O. de Moor, The Algebra of Programming (Prentice-Hall, Englewood Cliffs, NJ, to appear).
5. K. Clenaghan, Calculational graph algorithmics: reconciling two approaches with dynamic algebra, Report CS-R9518, CWI Amsterdam, 1995.
6. J.H. Conway, Regular Algebra and Finite Machines (Chapman and Hall, London, 1971).
7. C.J. Date, An Introduction to Database Systems, Vol. I, Addison-Wesley, Reading, MA, 4th edition, (1988).
8. J.P.H.W. van den Eijnde, Conservative fixpoint functions on a graph, in: R.S. Bird, C. Morgan and J. Woodcock, eds., Proc. 2nd Internat. Conf. on the Mathematics of Program Construction, Oxford, UK, 29 June-3 July 1992, Lecture Notes in Computer Science, Vol. 669 (Springer, Berlin, 1993).
9. N.D. Gautam, The validity of equations of complex algebras, Arch. Math. Logik Grundlag. 3 (1957) 117-124.
10. J. Gibbons, An initial-algebra approach to directed acyclic graphs, in: B. Möller, ed., Proc. 3rd Internat. Conf. on the Mathematics of Program Construction, Kloster Irsee, Germany, 17-21 July 1995, Lecture Notes in Computer Science, Vol. 947 (Springer, Berlin, 1995) 282-303.
11. U. Güntzer, W. Kießling and R. Bayer, Evaluation paradigms for deductive databases: from systolic to as-you-please, Report No. 18605, Institut für Informatik der Technischen Universität München, 1986.
12. D.J. King and J. Launchbury, Structuring depth-first search algorithms in Haskell, in: Proc. 22nd ACM Symp. on Principles of Programming Languages, San Francisco, CA, USA, January 1995.
13. S.C. Kleene, Introduction to Metamathematics (Van Nostrand, New York, 1952).
14. L. Meertens, Paramorphisms, Formal Aspects Comput. 4 (1992) 413-424.
15. B. Möller, Relations as a program development language, in: B. Möller, ed., Constructing Programs from Specifications, Proc. IFIP TC2/WG 2.1 Working Conf. on Constructing Programs from Specifications, Pacific Grove, CA, USA, 13-16 May 1991 (North-Holland, Amsterdam, 1991) 373-397.
16. B. Möller, Towards pointer algebra, Sci. Comput. Programming 21 (1993) 57-90.
17. B. Möller, Ideal streams, in: E.-R. Olderog, ed., Programming Concepts, Methods and Calculi, IFIP Transaction A-56 (North-Holland, Amsterdam, 1994) 39-58. http://www.informatik.uni-augsburg.de/info2/literature/Papers/ifiptransA56.html
18. B. Möller and M. Russling, Shorter paths to graph algorithms, in: R.S. Bird, C. Morgan and J. Woodcock, eds., Proc. 2nd Internat. Conf. on the Mathematics of Program Construction, Oxford, UK, 29 June-3 July 1992, Lecture Notes in Computer Science, Vol. 669 (Springer, Berlin, 1993); Extended version: Sci. Comput. Programming 22 (1994) 157-180. http://www.informattk.uni-augsburg.de/info2/mitarbeiter/Russling/scp.html
19. B. Möller and M. Russling, Shorter paths to graph algorithms, in: R.S. Bird, C. Morgan and J. Woodcock, eds., Proc. 2nd Internat. Conf. on the Mathematics of Program Construction, Oxford, UK, 29 June-3 July 1992, Lecture Notes in Computer Science, Vol. 669 (Springer, Berlin, 1993); Extended version: Sci. Comput. Programming 22 (1994) 157-180. http://www.informattk.uni-augsburg.de/info2/mitarbeiter/Russling/scp.html
20. C. Pair, Mille et un algorithmes pour les problème de cheminement dans les graphes, Revue Française d'Informatique Recherche Operationelle (R.I.R.O.) B-3 (1970) 125-143.
21. H.A. Partsch, Specification and Transformation of Programs - A Formal Approach to Software Development (Springer, Berlin, 1990).
22. M. Russling, An algebraic treatment of graph and sorting algorithms, in: Proc. 14th Int. SCCC Conf., Concepción, Chile, 31 October-4 November 1994. http://www.informatik.uni-augsburg.de/info2/mitarbeiter/Russling/chile.html
23. M. Russling, A general scheme for breadth-first graph traversal, in: B. Möller, ed., Proc. 3rd Internat. Conf. on the Mathematics of Program Construction, Kloster Irsee, Germany, 17-21 July 1995, Lecture Notes in Computer Science, Vol. 947 (Springer, Berlin, 1995) 380-398. http://www.informatik.uni-augsburg.de/info2/mitarbeiter/Russling/mpc95.html
24. G. Schmidt and T. Ströhlein, Relations and Graphs. Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science (Springer, Berlin, 1993).
25. J.L.A. van de Snepscheut, What Computing is All About (Springer, New York, 1993).
26. A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941) 73-89.
27. A. Tarski, A lattice theoretical fixpoint theorem and its applications, Pacific J. Math. 5 (1955) 285-310.