{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:03Z","timestamp":1757629503313,"version":"3.44.0"},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":[[1989,2]]},"DOI":"10.1016\/0743-7315(89)90040-3","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"20-38","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel algorithms for maximum bipartite matchings and maximum 0\u20131 flows"],"prefix":"10.1016","volume":"6","author":[{"given":"Baruch","family":"Schieber","sequence":"first","affiliation":[]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(89)90040-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"An O(n log n) sorting network","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorca"},{"key":"10.1016\/0743-7315(89)90040-3_BIB2","series-title":"Proc. 16th ACM Symposium on Theory of Computing","first-page":"522","article-title":"An efficient network synchronization protocol","author":"Awerbuch","year":"1984"},{"year":"1979","series-title":"Graph Algorithms","author":"Even","key":"10.1016\/0743-7315(89)90040-3_BIB3"},{"key":"10.1016\/0743-7315(89)90040-3_BIB4","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","article-title":"Network flow and testing graph connectivity","volume":"4","author":"Even","year":"1975","journal-title":"Siam J. Comput."},{"key":"10.1016\/0743-7315(89)90040-3_BIB5","series-title":"Proc. 26th Annual IEEE Symposium on Foundations of Computer Science","first-page":"490","article-title":"Improved processor bounds for algebraic and combinatorial problems in RNC","author":"Galil","year":"1985"},{"key":"10.1016\/0743-7315(89)90040-3_BIB6","first-page":"136","article-title":"A new approach to the maximum flow problem","author":"Goldberg","year":"1986"},{"key":"10.1016\/0743-7315(89)90040-3_BIB7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n2.5 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"Siam J. Comput."},{"key":"10.1016\/0743-7315(89)90040-3_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","article-title":"An improved parallel algorithm for maximal matching","volume":"22","author":"Israeli","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(89)90040-3_BIB9","series-title":"Proc. 17th ACM Symposium on Theory of Computing","first-page":"22","article-title":"Constructing a perfect matching is in random NC","author":"Karp","year":"1985"},{"article-title":"Size bounds and parallel algorithms for networks","year":"1980","author":"Lev","key":"10.1016\/0743-7315(89)90040-3_BIB10"},{"key":"10.1016\/0743-7315(89)90040-3_BIB11","series-title":"Proc. 21st Annual IEEE Symposium on Foundations of Computer Science","first-page":"17","article-title":"An O(\u221a|V| |E|) algorithm for finding maximum matching in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0743-7315(89)90040-3_BIB12","series-title":"Proc. 19th ACM Symposium on Theory of Computing","first-page":"345","article-title":"Matching is as easy as matrix inversion","author":"Mulmuley","year":"1987"},{"key":"10.1016\/0743-7315(89)90040-3_BIB13","series-title":"Proc. 5th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing","first-page":"282","article-title":"Slowing sequential algorithms for obtaining fast distributed and parallel algorithms: Maximum matchings","author":"Schieber","year":"1986"},{"key":"10.1016\/0743-7315(89)90040-3_BIB14","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0196-6774(82)90013-X","article-title":"An O(n2 log n) parallel max flow algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0743-7315(89)90040-3_BIB15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0743-7315(89)90040-3_BIB16","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"Siam J. Comput."},{"key":"10.1016\/0743-7315(89)90040-3_BIB17","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory address access in models that forbid it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"},{"year":"1979","series-title":"The complexity of parallel computation. TR 79-387","author":"Wyllie","key":"10.1016\/0743-7315(89)90040-3_BIB18"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900403?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731589900403?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:28:09Z","timestamp":1757514489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731589900403"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0743731589900403"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(89)90040-3","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1989,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallel algorithms for maximum bipartite matchings and maximum 0\u20131 flows","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(89)90040-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}