{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:10Z","timestamp":1725663610855},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540551218"},{"type":"electronic","value":"9783540467359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55121-2_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T04:47:16Z","timestamp":1330231636000},"page":"209-213","source":"Crossref","is-referenced-by-count":0,"title":["A new upper bound on the complexity of the all pairs shortest path problem"],"prefix":"10.1007","author":[{"given":"Tadao","family":"Takaoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"20_CR1","unstructured":"Aho, A.V., Hopcroft, J.E. and Ullman, J.D., The design and analysis of computer algorithms, Addison-Wesley (1974)."},{"key":"20_CR2","unstructured":"Akl, S.G., The design and analysis of parallel algorithms, Prentice-Hall (1989)."},{"issue":"No.4","key":"20_CR3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","volume":"10","author":"E. Dekel","year":"1981","unstructured":"Dekel, E., Nassimi, D. and Sahni, S., \u201cParallel matrix and graph algorithms,\u201d SIAM Jour. on Computing, Vol. 10, No. 4, pp. 657\u2013675 (1981).","journal-title":"SIAM Jour. on Computing"},{"issue":"No.3","key":"20_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1983.1676223","volume":"C-32","author":"E. Dekel","year":"1983","unstructured":"Dekel, E. and Sahni, S., \u201cBinary trees and parallel scheduling algorithms,\u201d IEEE Trans. on Computers, Vol. C-32, No. 3, pp. 307\u2013315 (1983)","journal-title":"IEEE Trans. on Computers"},{"issue":"No.1","key":"20_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L., \u201cNew bounds on the complexity of the shortest path problem,\u201d SIAM Jour. on Computing, Vol. 5, No. 1, pp. 83\u201385 (1976).","journal-title":"SIAM Jour. on Computing"},{"issue":"No.6","key":"20_CR6","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/0216065","volume":"16","author":"A. Moffat","year":"1987","unstructured":"Moffat, A. and Takaoka, T., \u201cAn all pairs shortest path algorithm with expected running time O(n 2 log n),\u201d SIAM Jour. on Computing, Vol. 16, No. 6, pp. 1023\u20131031 (1987).","journal-title":"SIAM Jour. on Computing"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Takaoka, T., \u201c An efficient parallel algorithm for the all pairs shortest path problem,\u201d WG 88, Lecture Notes in Computer Science 344, Springer-Verlag, pp. 276\u2013287 (1988).","DOI":"10.1007\/3-540-50728-0_51"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55121-2_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:57:38Z","timestamp":1605628658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55121-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540551218","9783540467359"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-55121-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}