{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:23Z","timestamp":1725663383884},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_51","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:32:35Z","timestamp":1330201955000},"page":"276-287","source":"Crossref","is-referenced-by-count":1,"title":["An efficient parallel algorithm for 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,5,31]]},"reference":[{"key":"20_CR1","unstructured":"A. V. Aho, J. E. Hopcroft and j. D. Ullman, \"The Design and Analysis of Computer Algorithms\", Addison-Wesley (1974)."},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1137\/0212039","volume":"12","author":"P.A. Bloniarz","year":"1983","unstructured":"P.A. Bloniarz, \"A shortest path algorithm with expected time O(n2log n log*n), SIAM Jour. on Computing 12 (1983), pp. 588\u2013600.","journal-title":"SIAM Jour. on Computing"},{"key":"20_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1287\/mnsc.6.2.187","volume":"6","author":"B.B. Dantzig","year":"1960","unstructured":"B.B. Dantzig, \"On the shortest route through a network\", Management Science 6 (1960), pp. 187\u2013190.","journal-title":"Management Science"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"E. D. Dekel, S. Nassimi and Sahni, \"Parallel matrix and graph algorithms\", SIAM Jour. on Computing 10 (1980).","DOI":"10.1137\/0210049"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, \"A note on two problems in connection with graphs\", Numer. Math. 1 (1959), pp. 269\u2013271","journal-title":"Numer. Math."},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R. W. Floyd","year":"1962","unstructured":"R. W. Floyd, \"Algorithm 97: shortest path\", Comm. ACM 5 (1962), p345.","journal-title":"Comm. ACM"},{"key":"20_CR7","unstructured":"A. Frieze and L. Rudolph, \"A parallel algorithm for all pairs shortest paths in a random graph\", Technical Report, Dept. of Com. Sci., Carnegie-Mellon Univ. (1982)."},{"key":"20_CR8","first-page":"1155","volume":"E70","author":"Q. P. Gu","year":"1987","unstructured":"Q. P. Gu and T. Takaoka, \"On the average path length of O(log n) in the shortest path problem\", Trans. of the IEICE of Japan E70 (1987) pp. 1155\u20131158.","journal-title":"Trans. of the IEICE of Japan"},{"key":"20_CR9","unstructured":"Q. P. Gu and T. Takaoka, \"A parallel algorithm for the all pairs shortest path problem\", submitted for publication."},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/0216065","volume":"6","author":"A. M. Moffat","year":"1987","unstructured":"A. M. Moffat and T. Takaoka, \"An all pairs shortest path algorithm with expected time O(n2log n)\", SIAM Jour. on Computing 6 (1987), pp. 1023\u20131031.","journal-title":"SIAM Jour. on Computing"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","volume":"16","author":"J. Quinn","year":"1984","unstructured":"J. Quinn and N. Deo, \"Parallel graph algorithms\", ACM Computing Surveys 16 (1984), pp. 319\u2013348.","journal-title":"ACM Computing Surveys"},{"key":"20_CR12","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0202004","volume":"2","author":"P. M. Spira","year":"1973","unstructured":"P. M. Spira, \"A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2log2n)\", SIAM Jour. on Computing 2 (1973), pp. 28\u201332.","journal-title":"SIAM Jour. on Computing"},{"key":"20_CR13","unstructured":"T. Takaoka and A. M. Moffat, \"An O(n2log n loglog n) expected time algorithm for the all shortest distance problem\", Lecture Notes in Computer Science 88, Springer (1980), pp. 642\u2013655."}],"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-50728-0_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:18:48Z","timestamp":1605647928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}