{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T08:55:52Z","timestamp":1648630552345},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":[[1994,1]]},"DOI":"10.1016\/0020-0190(94)90049-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"21-25","source":"Crossref","is-referenced-by-count":2,"title":["A shortest-path algorithm for Manhattan graphs"],"prefix":"10.1016","volume":"49","author":[{"given":"Kanchana","family":"Kanchanasut","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)90049-3_BIB1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"Two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0020-0190(94)90049-3_BIB2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/net.3230070404","article-title":"A shortest path algorithm for grid graphs","volume":"7","author":"Hadlock","year":"1977","journal-title":"Networks"},{"issue":"1","key":"10.1016\/0020-0190(94)90049-3_BIB3","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1109\/TC.1976.5009200","article-title":"Some variations of Lee's algorithm","volume":"25","author":"Hoel","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(94)90049-3_BIB4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01840435","article-title":"Shortest paths in Euclidean graphs","volume":"1","author":"Sedgewick","year":"1996","journal-title":"Algorithmica"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094900493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:06Z","timestamp":1555144146000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094900493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0020019094900493"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)90049-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}