{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:46Z","timestamp":1725664306062},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601173"},{"type":"electronic","value":"9783540494454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60117-1_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:44:00Z","timestamp":1330278240000},"page":"380-398","source":"Crossref","is-referenced-by-count":4,"title":["A general scheme for breadth-first graph traversal"],"prefix":"10.1007","author":[{"given":"Martin","family":"Russling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"21_CR1","volume-title":"Lecture Notes in Computer Science 669","author":"R.C. Backhouse","year":"1993","unstructured":"R.C. Backhouse, A.J.M. van Gasteren: Calculating a Path Algorithm. In R.S. Bird, C. Morgan, J. Woodcock (eds.): Proc. 2nd International Conference on the Mathematics of Program Construction, Oxford, UK, 29 June\u20133 July 1992. Lecture Notes in Computer Science 669. Berlin: Springer 1993. Extended version (together with J.P.H.W. van den Eijnde): Science of Computer Programming 22, 3\u201319 (1994)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"R.S. Bird","year":"1984","unstructured":"R.S. Bird: The Promotion and Accumulation Strategies in Transformational Programming. ACM Transactions on Programming Languages and Systems 6, 487\u2013504 (1984)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"R.S. Bird, O. de Moor: The Algebra of Programming (forthcoming book). Prentice Hall International 1996.","DOI":"10.1007\/978-3-642-61455-2_12"},{"key":"21_CR4","volume-title":"Report CS-R9518","author":"K. Clenaghan","year":"1995","unstructured":"K. Clenaghan: Calculational graph algorithmics: reconciling two approaches with dynamic algebra. CWI Amsterdam, Report CS-R9518, 1995"},{"key":"21_CR5","volume-title":"Regular algebra and finite machines","author":"J.H. Conway","year":"1971","unstructured":"J.H. Conway: Regular algebra and finite machines. London: Chapman and Hall 1971"},{"key":"21_CR6","volume-title":"An introduction to database systems. Vol. I","author":"C.J. Date","year":"1988","unstructured":"C.J. Date: An introduction to database systems. Vol. I, 4th edition. Reading, Mass.: Addison-Wesley 1988","edition":"4th edition"},{"key":"21_CR7","volume-title":"Lecture Notes in Computer Science 669","author":"J.P.H.W. Eijnde van den","year":"1993","unstructured":"J.P.H.W. van den Eijnde: Conservative fixpoint functions on a graph. In R.S. Bird, C. Morgan, J. Woodcock (eds.): Proc. 2nd International Conference on the Mathematics of Program Construction, Oxford, UK, 29 June\u20133 July 1992. Lecture Notes in Computer Science 669. Berlin: Springer 1993."},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01988052","volume":"3","author":"N.D. Gautam","year":"1957","unstructured":"N.D. Gautam: The validity of equations of complex algebras. Arch. Math. Logik Grundlag. 3, 117\u2013124 (1957)","journal-title":"Arch. Math. Logik Grundlag."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"J. Gibbons: Algebraic Models of Graphs. 46th Meeting of IFIP TC2\/WG 2.1, Renkum, The Netherlands, 10\u201313 January 1994, Document 722 REN-7","DOI":"10.1108\/10650759410798323"},{"key":"21_CR10","unstructured":"U. G\u00fcntzer, W. Kiessling, R. Bayer: Evaluation paradigms for deductive databases: from systolic to as-you-please. Institut f\u00fcr Informatik der Technischen Universit\u00e4t M\u00fcnchen, Report Nr. 18605, 1986"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"D.J. King, J. Launchbury: Structuring Depth-First Search Algorithms in Haskell. Proc. 22nd ACM Symposium on Principles of Programming Languages, San Francisco, CA, USA, January 1995.","DOI":"10.1145\/199448.199530"},{"key":"21_CR12","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"S.C. Kleene: Introduction to Metamathematics. New York: Van Nostrand 1952"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01211391","volume":"4","author":"L. Meertens","year":"1992","unstructured":"L. Meertens: Paramorphisms. Formal Aspects of Computing 4, 413\u2013424 (1992)","journal-title":"Formal Aspects of Computing"},{"key":"21_CR14","first-page":"373","volume-title":"Constructing programs from specifications","author":"B. M\u00f6ller","year":"1991","unstructured":"B. M\u00f6ller: Relations as a program development language. In B. M\u00f6ller (ed.): Constructing programs from specifications. Proc. IFIP TC2\/WG 2.1 Working Conference on Constructing Programs from Specifications, Pacific Grove, CA, USA, 13\u201316 May 1991. Amsterdam: North-Holland 1991, 373\u2013397"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"B. M\u00f6ller: Towards pointer algebra. Institut f\u00fcr Mathematik der Universit\u00e4t Augsburg, Report No. 279, 1993. Also in Science of Computer Programming 21, 57\u201390 (1993)","DOI":"10.1016\/0167-6423(93)90008-D"},{"key":"21_CR16","series-title":"IFIP Transaction A-56","first-page":"39","volume-title":"Programming Concepts, Methods and Calculi","author":"B. M\u00f6ller","year":"1994","unstructured":"B. M\u00f6ller: Ideal streams. In: E.-R. Olderog (ed.): Programming Concepts, Methods and Calculi. IFIP Transaction A-56. Amsterdam: North-Holland 1994, 39\u201358"},{"key":"21_CR17","volume-title":"Lecture Notes in Computer Science 669","author":"B. M\u00f6ller","year":"1993","unstructured":"B. M\u00f6ller, M. Russling: Shorter Paths to Graph Algorithms. In R.S. Bird, C. Morgan, J. Woodcock (eds.): Proc. 2nd International Conference on the Mathematics of Program Construction, Oxford, UK, 29 June\u20133 July 1992. Lecture Notes in Computer Science 669. Berlin: Springer 1993. Extended version: Science of Computer Programming 22, 157\u2013180 (1994)"},{"key":"21_CR18","first-page":"125","volume":"B-3","author":"C. Pair","year":"1970","unstructured":"C. Pair: Mille et un algorithmes pour les probl\u00e8me de cheminement dans les graphes. Revue Fran\u00e7aise d'Informatique et de Recherche op\u00e9rationelle (R.I.R.O.) B-3, 125\u2013143 (1970)","journal-title":"Revue Fran\u00e7aise d'Informatique et de Recherche op\u00e9rationelle (R.I.R.O.)"},{"key":"21_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61512-2","volume-title":"Specification and transformation of programs \u2014 A formal approach to software development","author":"H.A. Partsch","year":"1990","unstructured":"H.A. Partsch: Specification and transformation of programs \u2014 A formal approach to software development. Berlin: Springer 1990"},{"key":"21_CR20","unstructured":"M. Russling: An algebraic treatment of graph and sorting algorithms. Proc. 14th Int. SCCC Conference, Concepci\u00f3n, Chile, 31 October\u20134 November 1994. (Extended version: Institut f\u00fcr Mathematik der Universit\u00e4t Augsburg, Report Nr. 324, 1995)"},{"key":"21_CR21","series-title":"EATCS Monographs on Theoretical Computer Science","volume-title":"Discrete Mathematics for Computer Scientists","author":"G. Schmidt","year":"1993","unstructured":"G. Schmidt, T. Str\u00f6hlein: Relations and Graphs. Discrete Mathematics for Computer Scientists, EATCS Monographs on Theoretical Computer Science. Berlin: Springer 1993."},{"key":"21_CR22","volume-title":"What Computing is all about","author":"J.L.A. Snepscheut van de","year":"1993","unstructured":"J.L.A. van de Snepscheut: What Computing is all about. New York: Springer 1993."},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A. Tarski","year":"1941","unstructured":"A. Tarski: On the calculus of relations. J. Symbolic Logic 6, 73\u201389 (1941)","journal-title":"J. Symbolic Logic"},{"key":"21_CR24","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski: A lattice theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 285\u2013310 (1955)","journal-title":"Pacific J. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60117-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:55:17Z","timestamp":1687287317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60117-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601173","9783540494454"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60117-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}