{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:22Z","timestamp":1725584722455},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210693"},{"type":"electronic","value":"9783642210709"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21070-9_10","type":"book-chapter","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T04:02:27Z","timestamp":1307419347000},"page":"109-124","source":"Crossref","is-referenced-by-count":5,"title":["A Functional, Successor List Based Version of Warshall\u2019s Algorithm with Applications"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"Berghammer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","first-page":"131","volume":"53","author":"A. Aarts","year":"1996","unstructured":"Aarts, A., et al.: Fixed point calculus. Inform. Proc. Lett.\u00a053, 131\u2013136 (1996)","journal-title":"Inform. Proc. Lett."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"A. Aho","year":"1972","unstructured":"Aho, A., Garey, M., Ullman, J.: The transitive reduction of a directed graph. SIAM J. of Comput.\u00a01, 131\u2013137 (1972)","journal-title":"SIAM J. of Comput."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/1721654.1721675","volume":"53","author":"S. Antoy","year":"2010","unstructured":"Antoy, S., Hanus, M.: Functional logic programming. Comm. of the ACM\u00a053, 74\u201385 (2010)","journal-title":"Comm. of the ACM"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-19422-3_16","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Berghammer","year":"1988","unstructured":"Berghammer, R., Ehler, H., Zierer, H.: Development of graph algorithms by program transformation. In: G\u00f6ttler, H., Schneider, H.-J. (eds.) WG 1987. LNCS, vol.\u00a0314, pp. 206\u2013218. Springer, Heidelberg (1988)"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-7091-6510-2_9","volume-title":"Relational Methods in Computer Science","author":"R. Berghammer","year":"1997","unstructured":"Berghammer, R., von Karger, B.: Algorithms from relational specification. In: Brink, C., Kahl, W., Schmidt, G. (eds.) Relational Methods in Computer Science, pp. 131\u2013149. Springer, Heidelberg (1997)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/11555964_4","volume-title":"Computer Algebra in Scientific Computing","author":"R. Berghammer","year":"2005","unstructured":"Berghammer, R., Neumann, F.: RelView \u2013 An OBDD-Based Computer Algebra System for Relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol.\u00a03718, pp. 40\u201351. Springer, Heidelberg (2005)"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.entcs.2007.01.011","volume":"177","author":"R. Berghammer","year":"2007","unstructured":"Berghammer, R., Fischer, S.: Implementing relational specifications in a constraint functional language. Electr. Notes on Theor. Comput. Sci.\u00a0177, 169\u2013183 (2007)","journal-title":"Electr. Notes on Theor. Comput. Sci."},{"key":"10_CR8","unstructured":"Berghammer, R.: Ordnungen, Verb\u00e4nde und Relationen mit Anwendungen (Orders, lattices and relations with applications). Vieweg-Teubner, Stuttgart (2008)"},{"key":"10_CR9","volume-title":"Introduction to functional programming using Haskell","author":"R. Bird","year":"1998","unstructured":"Bird, R.: Introduction to functional programming using Haskell, 2nd edn. Prentice-Hall, Englewood Cliffs (1998)","edition":"2"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R.M. Burstall","year":"1977","unstructured":"Burstall, R.M., Darlington, J.: A transformation system for developing recursive programs. J. of the ACM\u00a024, 44\u201367 (1977)","journal-title":"J. of the ACM"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-85654-2_12","volume-title":"Database and Expert Systems Applications","author":"Y. Chen","year":"2008","unstructured":"Chen, Y.: On the evaluation of large and sparse graph reachability queries. In: Bhowmick, S.S., K\u00fcng, J., Wagner, R. (eds.) DEXA 2008. LNCS, vol.\u00a05181, pp. 97\u2013105. Springer, Heidelberg (2008)"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/258949.258955","volume":"32","author":"M. Erwig","year":"1997","unstructured":"Erwig, M.: Functional programming with graphs. ACM SIGPLAN Notices\u00a032, 52\u201365 (1997)","journal-title":"ACM SIGPLAN Notices"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1017\/S0956796801004075","volume":"11","author":"M. Erwig","year":"2001","unstructured":"Erwig, M.: Inductive graphs and functional graph algorithms. J. of Funct. Progr.\u00a011, 467\u2013492 (2001)","journal-title":"J. of Funct. Progr."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R.W. Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97 (Shortest path). Comm. of the ACM\u00a05, 345 (1962)","journal-title":"Comm. of the ACM"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredmann","year":"1976","unstructured":"Fredmann, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. on Comput.\u00a05, 83\u201389 (1976)","journal-title":"SIAM J. on Comput."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/3-540-60117-1_16","volume-title":"Mathematics of Program Construction","author":"J. Gibbons","year":"1995","unstructured":"Gibbons, J.: An initial algebra approach to directed graphs. In: M\u00f6ller, B. (ed.) MPC 1995. LNCS, vol.\u00a0947, pp. 282\u2013303. Springer, Heidelberg (1995)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11828563_16","volume-title":"Relations and Kleene Algebra in Computer Science","author":"W. Kahl","year":"2006","unstructured":"Kahl, W.: Semigroupoid interfaces for relation-algebraic programming in Haskell. In: Schmidt, R.A. (ed.) RelMiCS\/AKA 2006. LNCS, vol.\u00a04136, pp. 235\u2013250. Springer, Heidelberg (2006)"},{"key":"10_CR18","first-page":"344","volume-title":"ACM Symposium on Principles of Programming","author":"D.J. King","year":"1995","unstructured":"King, D.J., Launchbury, J.: Structuring depth-first search algorithms in Haskell. In: ACM Symposium on Principles of Programming, pp. 344\u2013356. ACM, New York (1995)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Launchbury, J.: Graph algorithms with a functional flavour. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol.\u00a0925, pp. 308\u2013331 (2005)","DOI":"10.1007\/3-540-59451-5_9"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-48340-3_11","volume-title":"Mathematical Foundations of Computer Science 1999","author":"M. Lohrey","year":"1999","unstructured":"Lohrey, M.: Complexity results for confluence problems. In: Kuty\u0142owski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol.\u00a01672, pp. 114\u2013124. Springer, Heidelberg (1999)"},{"key":"10_CR21","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1009969528224","volume":"3","author":"G. Penn","year":"2000","unstructured":"Penn, G.: The algebraic structure of transitive closure and its application to attributed type signatures. Grammars\u00a03, 295\u2013312 (2000)","journal-title":"Grammars"},{"key":"10_CR22","series-title":"Discrete Mathematics for Computer Scientists","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-77968-8","volume-title":"Relations and graphs","author":"G. Schmidt","year":"1993","unstructured":"Schmidt, G., Str\u00f6hlein, T.: Relations and graphs. Discrete Mathematics for Computer Scientists. Springer, Heidelberg (1993)"},{"key":"10_CR23","first-page":"314","volume":"1","author":"G. Schmidt","year":"2004","unstructured":"Schmidt, G.: A proposal for a multilevel relational reference language. J. of Relat. Meth. in Comput. Sci.\u00a01, 314\u2013338 (2004)","journal-title":"J. of Relat. Meth. in Comput. Sci."},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Num. Math.\u00a013, 354\u2013356 (1969)","journal-title":"Num. Math."},{"key":"10_CR25","volume-title":"Haskell \u2013 The craft of functional programming","author":"S. Thompson","year":"1999","unstructured":"Thompson, S.: Haskell \u2013 The craft of functional programming. Addison-Wesley, Reading (1999)"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on Boolean matrices. J. of the ACM\u00a09, 11\u201312 (1962)","journal-title":"J. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21070-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T13:07:40Z","timestamp":1560258460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21070-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210693","9783642210709"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21070-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}