{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T17:05:45Z","timestamp":1706202345550},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,9,1]],"date-time":"1985-09-01T00:00:00Z","timestamp":494380800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,9]]},"DOI":"10.1016\/0196-6774(85)90009-4","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"400-408","source":"Crossref","is-referenced-by-count":13,"title":["A theorem on the expected complexity of dijkstra's shortest path algorithm"],"prefix":"10.1016","volume":"6","author":[{"given":"Kohei","family":"Noshita","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90009-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"No. 3","key":"10.1016\/0196-6774(85)90009-4_BIB2","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1137\/0212039","article-title":"A shortest path algorithm with expected time O(n2lognlog\u2217n)","volume":"12","author":"Bloniarz","year":"1983","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0196-6774(85)90009-4_BIB3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connexion with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90009-4_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1137\/0205006","article-title":"New bounds on the complexity of the shortest path problem","volume":"5","author":"Fredman","year":"1976","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0196-6774(85)90009-4_BIB5","series-title":"Technical Report","article-title":"On Random Shortest Path Problems","author":"Frieze","year":"1982"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90009-4_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321992.321993","article-title":"Efficient algorithms for shortest paths in sparse networks","volume":"24","author":"Johnson","year":"1977","journal-title":"J. Assoc. Comput. Mach"},{"key":"10.1016\/0196-6774(85)90009-4_BIB7","first-page":"510","article-title":"On shortest paths and sorting","volume":"Vol. 1","author":"Johnson","year":"1972"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90009-4_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.5.1.1","article-title":"Combinatorial optimization: What is the state of the art","volume":"5","author":"Klee","year":"1980","journal-title":"Math. Oper. Res"},{"key":"10.1016\/0196-6774(85)90009-4_BIB9","author":"Knuth","year":"1968"},{"issue":"No. 5","key":"10.1016\/0196-6774(85)90009-4_BIB10","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(78)90007-8","article-title":"On the expected behavior of the Dijkstra's shortest path algorithm for complete graphs","volume":"7","author":"Noshita","year":"1978","journal-title":"Inform. Process. Lett"},{"key":"10.1016\/0196-6774(85)90009-4_BIB11","first-page":"1389","article-title":"Shortest connection networks and some generalizations","volume":"36","author":"Prim","year":"1957","journal-title":"BSTJ"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90009-4_BIB12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0202004","article-title":"A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2log2n)","volume":"2","author":"Spira","year":"1973","journal-title":"SIAM J. Comput"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900094?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900094?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:26:03Z","timestamp":1548743163000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,9]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,9]]}},"alternative-id":["0196677485900094"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90009-4","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,9]]}}}