{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:41:59Z","timestamp":1649108519426},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1990,11]]},"DOI":"10.1016\/0167-8191(90)90159-7","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T02:10:42Z","timestamp":1060308642000},"page":"61-67","source":"Crossref","is-referenced-by-count":2,"title":["A sharper analysis of a parallel algorithm for the all pairs shortest path problem"],"prefix":"10.1016","volume":"16","author":[{"given":"Qian Ping","family":"Gu","sequence":"first","affiliation":[]},{"given":"Tadao","family":"Takaoka","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(90)90159-7_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-8191(90)90159-7_BIB2","series-title":"Probabilistic Methods in Combinatorics","author":"Erd\u00f6s","year":"1974"},{"key":"10.1016\/0167-8191(90)90159-7_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0166-218X(85)90059-9","article-title":"The shortest path problem for graphs with random arc lengths","volume":"10","author":"Frieze","year":"1985","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0167-8191(90)90159-7_BIB4","series-title":"Proc. 22nd Annual Allerton Conf. Communication, Control and Computation","first-page":"663","article-title":"A parallel algorithm for all pairs shortest paths in a random graph","author":"Frieze","year":"1984"},{"issue":"11","key":"10.1016\/0167-8191(90)90159-7_BIB5","first-page":"1155","article-title":"On the average path length of O(log n) in the shortest path problem","volume":"E70","author":"Gu","year":"1987","journal-title":"Trans. IEICE Japan"},{"issue":"2","key":"10.1016\/0167-8191(90)90159-7_BIB6","first-page":"119","article-title":"An O(n(n2\/p + log p)) parallel algorithm to compute the all pairs shortest paths and the transitive closure","volume":"12","author":"Ma","year":"1989","journal-title":"J. Inform. Process."},{"issue":"3","key":"10.1016\/0167-8191(90)90159-7_BIB7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/2514.2515","article-title":"Parallel graph algorithms","volume":"16","author":"Quinn","year":"1984","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0167-8191(90)90159-7_BIB8","series-title":"19th STOC ACM","first-page":"285","article-title":"On the learnibility of Boolean formulae","author":"Kearns","year":"1987"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190901597?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819190901597?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,14]],"date-time":"2019-03-14T21:26:19Z","timestamp":1552598779000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819190901597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["0167819190901597"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(90)90159-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}