{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T17:02:45Z","timestamp":1706202165938},"reference-count":13,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1978,8,1]],"date-time":"1978-08-01T00:00:00Z","timestamp":270777600000},"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":[[1978,8]]},"DOI":"10.1016\/0020-0190(78)90007-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"237-243","source":"Crossref","is-referenced-by-count":7,"title":["On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Kohei","family":"Noshita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Etsuo","family":"Masuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hajime","family":"Machida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(78)90007-8_BIB1","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":"Num. Math."},{"key":"10.1016\/0020-0190(78)90007-8_BIB2","first-page":"1389","article-title":"Shortest connection networks and some generalizations","author":"Prim","year":"1957","journal-title":"BSTJ"},{"key":"10.1016\/0020-0190(78)90007-8_BIB3","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(78)90007-8_BIB4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1137\/0204032","article-title":"On finding and updating spanning trees and shortest paths","volume":"4","author":"Spira","year":"1975","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0020-0190(78)90007-8_BIB5","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1145\/800193.569965","article-title":"On Shortest Paths and Sorting","author":"Johnson","year":"1972","journal-title":"Proc. ACM 25th Annual Conf."},{"key":"10.1016\/0020-0190(78)90007-8_BIB6","series-title":"Ph.D. Thesis","article-title":"Algorithms for Shortest Paths","author":"Johnson","year":"1973"},{"key":"10.1016\/0020-0190(78)90007-8_BIB7","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":"JACM"},{"key":"10.1016\/0020-0190(78)90007-8_BIB8","series-title":"Third Symposium on Theory of Programs","article-title":"On Data Structures for Manipulating Graphs and a New Efficient Program of the Dijkstra's Method for Shortest Path Problems","author":"Noshita","year":"1973"},{"key":"10.1016\/0020-0190(78)90007-8_BIB9","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 ares in average time O(n2 log2n)","volume":"2","author":"Spira","year":"1973","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0020-0190(78)90007-8_BIB10","volume":"Vol. 2","author":"Knuth","year":"1969"},{"key":"10.1016\/0020-0190(78)90007-8_BIB11","series-title":"Master Thesis","article-title":"A Study on the Computational Efficiency of Shortest Path Algorithms","author":"Masuda","year":"1977"},{"issue":"1","key":"10.1016\/0020-0190(78)90007-8_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(77)90002-3","article-title":"A Generalization of Dijkstra's Algorithm","volume":"6","author":"Knuth","year":"1977","journal-title":"Inf. Proc. Letters"},{"key":"10.1016\/0020-0190(78)90007-8_BIB13","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1137\/0206050","article-title":"A Note on Spira's Algorithm for All-Pairs Shortest-Path Problem","volume":"6","author":"Carson","year":"1977","journal-title":"SIAM J. Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019078900078?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019078900078?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:27:42Z","timestamp":1555072062000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019078900078"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,8]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1978,8]]}},"alternative-id":["0020019078900078"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(78)90007-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1978,8]]}}}