{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T13:15:12Z","timestamp":1777468512589,"version":"3.51.4"},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,5,1]],"date-time":"1983-05-01T00:00:00Z","timestamp":420595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11035,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1983,5]]},"DOI":"10.1016\/0166-218x(83)90104-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"91-93","source":"Crossref","is-referenced-by-count":6,"title":["An O(mlog logD) algorithm for shortest paths"],"prefix":"10.1016","volume":"6","author":[{"given":"Rolf G.","family":"Karlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patricio V.","family":"Poblete","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(83)90104-X_BIB1","doi-asserted-by":"crossref","first-page":"269","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\/0166-218X(83)90104-X_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(80)90004-9","article-title":"An O(mlogD) algorithm for shortest paths","volume":"2","author":"Hansen","year":"1980","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(83)90104-X_BIB3","series-title":"Report CS-81-13","article-title":"A priority queue in which initialization and queue operations take O(log logD) time","author":"Johnson","year":"1981"},{"key":"10.1016\/0166-218X(83)90104-X_BIB4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Van Emde Boas","year":"1977","journal-title":"Math. Systems Theory"},{"issue":"3","key":"10.1016\/0166-218X(83)90104-X_BIB5","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"Van Emde Boas","year":"1977","journal-title":"Information Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8390104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8390104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:00Z","timestamp":1555136760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X8390104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,5]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,5]]}},"alternative-id":["0166218X8390104X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(83)90104-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1983,5]]}}}