{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:02Z","timestamp":1725456062207},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540543430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0028261","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T05:52:14Z","timestamp":1132638734000},"page":"189-200","source":"Crossref","is-referenced-by-count":11,"title":["Unstructured path problems and the making of semirings"],"prefix":"10.1007","author":[{"given":"T.","family":"Lengauer","sequence":"first","affiliation":[]},{"given":"D.","family":"Theune","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Engineering. Addison-Wesley, Reading, MA, 1974."},{"key":"18_CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"R. C. Backhouse","year":"1975","unstructured":"R. C. Backhouse and B. A. Carr\u00e9. Regular algebra applied to path-finding problems. Journal of the Institute of Mathematics and its Applications, 15:161\u2013186, 1975.","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"18_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"J. Berstel. Transductions and Context-Free Languages. Teubner Verlag, Stuttgart, Germany, 1979."},{"key":"18_CR4","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"J. Berstel","year":"1984","unstructured":"J. Berstel and C. Reutenauer. Rational Series and Their Languages. EATCS Monographs on Theoretical Computer Science. Springer Verlag, New York, NY, 1984."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1093\/imamat\/7.3.273","volume":"7","author":"B. A. Carr\u00e9","year":"1971","unstructured":"B. A. Carr\u00e9. An algebra for network routing problems. Journal of the Institute of Mathematics and its Applications, 7:273\u2013294, 1971.","journal-title":"Journal of the Institute of Mathematics and its Applications"},{"key":"18_CR6","unstructured":"B. A. Carr\u00e9. Graphs and Networks. Oxford Applied Mathematics and Computing Science Series. Clarendon Press, 1979."},{"key":"18_CR7","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990."},{"issue":"3","key":"18_CR8","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery, 32(3):505\u2013536, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"6","key":"18_CR9","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/358876.358884","volume":"23","author":"J. G. Fletcher","year":"1980","unstructured":"J. G. Fletcher. A more general algorithm for computing closed semiring costs between vertices of a directed graph. Communications of the Association for Computing Machinery, 23(6):350\u2013351, 1980.","journal-title":"Communications of the Association for Computing Machinery"},{"issue":"6","key":"18_CR10","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. N. Floyd","year":"1962","unstructured":"R. N. Floyd. Algorithm 97\u2014shortest path. Communications of the Association for Computing Machinery, 5(6):345, 1962.","journal-title":"Communications of the Association for Computing Machinery"},{"key":"18_CR11","volume-title":"Wiley-Interscience Series in Discrete Mathematics","author":"M. Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux. Graphs and Algorithms. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Chichester, U.K., 1984."},{"key":"18_CR12","unstructured":"W. John. Remarks to the solution of EMC-problems on printed circuit boards. In Proceedings of the Seventh International Conference on Electromagnetic Compatbility, pages 68\u201372, York, U.K., 1990."},{"key":"18_CR13","first-page":"3","volume-title":"Automata Studies","author":"S. C. Kleene","year":"1956","unstructured":"S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, pages 3\u201340. Princeton University Press, Princeton, NJ, 1956."},{"key":"18_CR14","series-title":"Springer Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-54233-7_144","volume-title":"18th International Symposium on Automata, Languages, and Programming","author":"T. Lengauer","year":"1991","unstructured":"T. Lengauer and D. Theune. Efficient algorithms for path problems with general cost criteria. In B. Monien and M. Rodriguez-Artalejo, editors, 18th International Symposium on Automata, Languages, and Programming, pages 314\u2013326. Springer Lecture Notes in Computer Science, No. 510 Springer Verlag, New York, 1991."},{"issue":"3","key":"18_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02253318","volume":"34","author":"G. Rote","year":"1985","unstructured":"G. Rote. A systolic array algorithm for the algebraic path problem (shortest path, matrix inversion). Computing, 34(3):191\u2013219, 1985.","journal-title":"Computing"},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-7091-9076-0_9","volume":"7","author":"G. Rote","year":"1990","unstructured":"G. Rote. Path problems in graphs. Computing Supplement, 7:155\u2013189, 1990.","journal-title":"Computing Supplement"},{"issue":"3","key":"18_CR17","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R. E. Tarjan","year":"1981","unstructured":"R. E. Tarjan. Fast algorithms for solving path problems. Journal of the Association for Computing Machinery, 28(3):594\u2013614, 1981.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"18_CR18","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1145\/322261.322272","volume":"28","author":"R. E. Tarjan","year":"1981","unstructured":"R. E. Tarjan. A unified approach to path problems. Journal of the Association for Computing Machinery, 28(3):577\u2013593, 1981.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"18_CR19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"S. Warshall. A theorem on boolean matrices. Journal of the Association for Computing Machinery, 9(1):11\u201312, 1962.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"18_CR20","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(79)90061-X","volume":"26","author":"A. Wongseelashote","year":"1979","unstructured":"A. Wongseelashote. Semirings and path spaces. Discrete Mathematics, 26:55\u201378, 1979.","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028261.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:58:36Z","timestamp":1607551116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540543430"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0028261","relation":{},"subject":[]}}