{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T04:43:39Z","timestamp":1649047419425},"reference-count":6,"publisher":"Elsevier BV","issue":"2-4","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0020-0190(00)00203-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:58:31Z","timestamp":1027627111000},"page":"213-217","source":"Crossref","is-referenced-by-count":0,"title":["The shortest path in parallel"],"prefix":"10.1016","volume":"77","author":[{"given":"Beverly A.","family":"Sanders","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00203-9_BIB001","series-title":"Parallel and Distributed Computational Numerical Methods","author":"Bertsekas","year":"1989"},{"key":"10.1016\/S0020-0190(00)00203-9_BIB002","series-title":"Parallel Program Design: A Foundation","author":"Chandy","year":"1988"},{"key":"10.1016\/S0020-0190(00)00203-9_BIB003","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/S0020-0190(00)00203-9_BIB004","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0020-0190(00)00202-7","article-title":"A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation","volume":"77","author":"Misra","year":"2001","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(00)00203-9_BIB005","series-title":"Proceedings of the International Symposium on Theory of Switching Circuits","first-page":"285","article-title":"The shortest path through a maze","author":"Moore","year":"1957"},{"key":"10.1016\/S0020-0190(00)00203-9_BIB006","series-title":"Parallel Programming Techniques and Applications Using Networked Workstations and Parallel Computers","author":"Wilkinson","year":"1999"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000002039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000002039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T02:51:37Z","timestamp":1555901497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000002039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":6,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0020019000002039"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00203-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}