{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T23:11:09Z","timestamp":1785971469637,"version":"3.56.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,6]]},"DOI":"10.1016\/0196-6774(82)90013-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"128-146","source":"Crossref","is-referenced-by-count":144,"title":["An O(n2log n) parallel max-flow algorithm"],"prefix":"10.1016","volume":"3","author":[{"given":"Yossi","family":"Shiloach","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90013-X_BIB1","unstructured":"D. A. Alton and D. M. Eckstein, Parallel breadth-first search of p sparse graphs, Utilitas Math., in press."},{"key":"10.1016\/0196-6774(82)90013-X_BIB2","first-page":"307","article-title":"Sorting networks and their applications","volume":"32","author":"Batcher","year":"1968"},{"key":"10.1016\/0196-6774(82)90013-X_BIB3","first-page":"1277","article-title":"Algorithm for solution of a problem of maximum flow in a network with power estimation","volume":"11","author":"Dinic","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(82)90013-X_BIB4","unstructured":"D. M. Eckstein and D. A. Alton, Parallel searching of nonsparse graps, Siam J. Comput., in press."},{"key":"10.1016\/0196-6774(82)90013-X_BIB5","article-title":"Parallel Processing Using Depth Search and Breadth-First Search","author":"Eckstein","year":"1977"},{"issue":"No. 4","key":"10.1016\/0196-6774(82)90013-X_BIB6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1145\/360924.360941","article-title":"Parallelism in tape-sorting","volume":"17","author":"Even","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(82)90013-X_BIB7","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"issue":"No. 10","key":"10.1016\/0196-6774(82)90013-X_BIB8","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/361020.361216","article-title":"Merging with parallel processors","volume":"18","author":"Gavril","year":"1975","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0196-6774(82)90013-X_BIB9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0022-0000(80)90035-5","article-title":"An O(\u2225E\u2225\u2225V\u2225 log2) algorithm for the maximal flow problem","volume":"21","author":"Galil","year":"1980","journal-title":"J. Comput. System Sci."},{"issue":"No. 8","key":"10.1016\/0196-6774(82)90013-X_BIB10","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","article-title":"Computing connected components on parallel computers","volume":"22","author":"Hirschberg","year":"1979","journal-title":"Comm. ACM"},{"issue":"No. 4","key":"10.1016\/0196-6774(82)90013-X_BIB11","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/1020096","article-title":"A survey of parallel algorithms in numerical linear algebra","volume":"20","author":"Heller","year":"1978","journal-title":"SIAM Rev."},{"issue":"No. 8","key":"10.1016\/0196-6774(82)90013-X_BIB12","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","article-title":"Fast parallel sorting algorithms","volume":"21","author":"Hirschberg","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(82)90013-X_BIB13","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(82)90013-X_BIB14","series-title":"Computer Science Program","article-title":"An O(\u2225V\u22253) Algorithm for Finding Maximum Flows in Networks","author":"Malhorta","year":"1978"},{"key":"10.1016\/0196-6774(82)90013-X_BIB15","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","article-title":"New parallel-sorting schemes","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"issue":"No. 2","key":"10.1016\/0196-6774(82)90013-X_BIB16","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0207020","article-title":"Parallel computations in graph theory","volume":"7","author":"Reghbati (Arjomandi)","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90013-X_BIB17","article-title":"Parallel Algorithms for Graph Theoretic Problems","author":"Savage","year":"1977"},{"key":"10.1016\/0196-6774(82)90013-X_BIB18","article-title":"An O(nIlog2n) Max=Flow Algorithm","author":"Shiloach","year":"1978"},{"key":"10.1016\/0196-6774(82)90013-X_BIB19","article-title":"An O(nm log n) Algorithm for Maximum Network Flow","author":"Sleator","year":"1981"},{"issue":"No. 1","key":"10.1016\/0196-6774(82)90013-X_BIB20","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum merging and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algor."},{"key":"10.1016\/0196-6774(82)90013-X_BIB21","unstructured":"Y. Shiloach and U. Vishkin, An O(log n) parallel connectivity algorithm, J. Algor., in press."},{"issue":"No. 3","key":"10.1016\/0196-6774(82)90013-X_BIB22","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90013-X_BIB23","article-title":"Synchronized Parallel Computation","author":"Vishkin","year":"1981"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748290013X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748290013X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:52:00Z","timestamp":1548744720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748290013X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["019667748290013X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90013-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}