{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T05:49:07Z","timestamp":1760852947957,"version":"3.44.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,10]]},"DOI":"10.1016\/0743-7315(91)90083-l","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"124-138","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":44,"title":["Scalability of parallel algorithms for the all-pairs shortest-path problem"],"prefix":"10.1016","volume":"13","author":[{"given":"Vipin","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vineet","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1983","series-title":"Data Structures and Algorithms. Computer Science and Information Processing","author":"Aho","key":"10.1016\/0743-7315(91)90083-L_BIB1"},{"year":"1989","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","key":"10.1016\/0743-7315(91)90083-L_BIB2"},{"key":"10.1016\/0743-7315(91)90083-L_BIB3","first-page":"307","article-title":"Parallel and Distributed Computation.: Numerical Methods","author":"Bertsekas","year":"1989"},{"year":"1989","series-title":"Introduction to Parallel Programming","author":"Brawer","key":"10.1016\/0743-7315(91)90083-L_BIB4"},{"key":"10.1016\/0743-7315(91)90083-L_BIB5","series-title":"Proc. 1989 International Conference on Parallel Processing","first-page":"I","article-title":"Multicast communication in multiprocessor systems","author":"Byrd","year":"1989"},{"article-title":"A VLSI architecture for concurrent data structures","year":"1986","author":"Dally","key":"10.1016\/0743-7315(91)90083-L_BIB6"},{"key":"10.1016\/0743-7315(91)90083-L_BIB7","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1002\/net.3230140208","article-title":"Shortest path algorithms: Taxonomy and annotation","author":"Deo","year":"1984","journal-title":"Networks"},{"key":"10.1016\/0743-7315(91)90083-L_BIB8","series-title":"Proc. IEEE International Conference on Parallel Processing","first-page":"244","article-title":"Two parallel algorithms for shortest path problems","author":"Deo","year":"1980"},{"key":"10.1016\/0743-7315(91)90083-L_BIB9_1","series-title":"Proc. Frontiers 90 Conference on Massively Parallel Computation","article-title":"On the scalability of FFT on parallel computers","author":"Gupta","year":"1990"},{"issue":"5","key":"10.1016\/0743-7315(91)90083-L_BIB10","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1145\/42411.42415","article-title":"Reevaluating Amdahl's law","volume":"31","author":"Gustafson","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(91)90083-L_BIB11","series-title":"International Conference on Parallel Processing","first-page":"713","article-title":"All pairs shortest paths on a hypercube multiprocessor","author":"Jenq","year":"1987"},{"key":"10.1016\/0743-7315(91)90083-L_BIB12","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-19488-6_126","article-title":"A complexity theory of efficient parallel algorithms","author":"Kruskal","year":"1988"},{"key":"10.1016\/0743-7315(91)90083-L_BIB13","series-title":"Proc. International Conference on Parallel Processing","article-title":"Scalability of parallel algorithms for the all-pairs shortest path problem: A summary of results","author":"Kumar","year":"1990"},{"key":"10.1016\/0743-7315(91)90083-L_BIB14_1","series-title":"Proc. 1991 International Conference on Supercomputing","article-title":"Analyzing the scalability of parallel algorithms and architectures: A survey","author":"Kumar","year":"1991"},{"key":"10.1016\/0743-7315(91)90083-L_BIB15","series-title":"Parallel Algorithms for Machine Intelligence and Vision","article-title":"Scalable parallel formulations of depth-first search","author":"Kumar","year":"1990"},{"issue":"6","key":"10.1016\/0743-7315(91)90083-L_BIB16","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/BF01389001","article-title":"Parallel depth-first search. II. Analysis","volume":"16","author":"Kumar","year":"1987","journal-title":"Internat. J Parallel Programming"},{"key":"10.1016\/0743-7315(91)90083-L_BIB17","series-title":"Proc. 1989 Conference on Hypercubes, Concurrent Computers and Applications","first-page":"603","article-title":"Load balancing on the hypercube architecture","author":"Kumar","year":"1989"},{"key":"10.1016\/0743-7315(91)90083-L_BIB18","series-title":"Tech. Rep. ACT-OODS-058-90","article-title":"Scalability of parallel algorithms for the allpairs shortest path problem","author":"Kumar","year":"1990"},{"key":"10.1016\/0743-7315(91)90083-L_BIB19","series-title":"Proc. 1989 International Conference on Parallel Processing","first-page":"14","article-title":"Parallel algorithms for shortest path problems","author":"Paige","year":"1985"},{"key":"10.1016\/0743-7315(91)90083-L_BIB20","series-title":"Proc. International Conference on Parallel Processing","first-page":"431","article-title":"Data structures for the efficient solution of graph theoretic problems on tightly-coupled MIMD computers","author":"Quinn","year":"1984"},{"year":"1990","series-title":"Hypercube Algorithms for Image Processing and Pattern Recognition","author":"Ranka","key":"10.1016\/0743-7315(91)90083-L_BIB21"},{"key":"10.1016\/0743-7315(91)90083-L_BIB22_1","series-title":"Proc. Fifth International Parallel Processing Symposium","article-title":"Scalability of parallel sorting on mesh multicomputers","author":"Singh","year":"1991"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190083L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190083L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:07Z","timestamp":1757514547000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190083L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["074373159190083L"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90083-l","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Scalability of parallel algorithms for the all-pairs shortest-path problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90083-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}