{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:57:31Z","timestamp":1725487051074},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425229"},{"type":"electronic","value":"9783540447436"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44743-1_28","type":"book-chapter","created":{"date-parts":[[2007,6,29]],"date-time":"2007-06-29T06:23:38Z","timestamp":1183098218000},"page":"285-292","source":"Crossref","is-referenced-by-count":5,"title":["An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs"],"prefix":"10.1007","author":[{"given":"A. S.","family":"Nepomniaschaya","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"issue":"1","key":"28_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"R. Bellman. On a Routing Problem. In: Quarterly of Applied Mathematics, 16, No. 1 (1958) 87\u201390.","journal-title":"Quarterly of Applied Mathematics"},{"key":"28_CR2","volume-title":"An Algorithmic Approach","author":"N. Christofides","year":"1975","unstructured":"N. Christofides. Graph Theory, An Algorithmic Approach. Academic Press, New York (1975)."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra. A Note on Two Problems in Connection with Graphs. In: Numerische Mathematik, 1 (1959) 269\u2013271.","journal-title":"Numerische Mathematik"},{"key":"28_CR4","unstructured":"L.R. Ford. Network Flow Theory. Rand Corporation Report P-923 (1956)."},{"key":"28_CR5","volume-title":"Content Addressable Parallel Processors","author":"C.C. Foster","year":"1976","unstructured":"C.C. Foster. Content Addressable Parallel Processors. Van Nostrand Reinhold Company, New York (1976)."},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1109\/ICPADS.1997.652606","volume-title":"Proc. of the Intern. Conf. on Parallel and Distributed Systems","author":"A.S. Nepomniaschaya","year":"1997","unstructured":"A.S. Nepomniaschaya. Solution of Path Problems Using Associative Parallel Processors. In: Proc. of the Intern. Conf. on Parallel and Distributed Systems, IEEE Computer Society Press, ICPADS\u201997, Korea, Seoul (1997) 610\u2013617."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-2000-43123412","volume":"43","author":"A.S. Nepomniaschaya","year":"2000","unstructured":"A.S. Nepomniaschaya, M.A. Dvoskina. A Simple Implementation of Dijkstra\u2019s Shortest Path Algorithm on Associative Parallel Processors. In: Fundamenta Informaticae, IOS Press, 43 (2000) 227\u2013243.","journal-title":"Fundamenta Informaticae"},{"key":"28_CR8","unstructured":"A.S. Nepomniaschaya. An Associative Version of the Edmonds-Karp-Ford Shortest Path Algorithm. In: Bull. of the Novosibirsk Computing Center. Series: Computer Science. NCC Publisher, to appear."}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44743-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T20:38:37Z","timestamp":1587674317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44743-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425229","9783540447436"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44743-1_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}