{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T18:38:25Z","timestamp":1648924705987},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0167-6377(94)90021-3","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"47-49","source":"Crossref","is-referenced-by-count":0,"title":["Finding maximum matching for bipartite graphs in parallel"],"prefix":"10.1016","volume":"16","author":[{"given":"Pranay","family":"Chaudhuri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90021-3_BIB1","first-page":"842","article-title":"Two theorems in graph theory","volume":"43","author":"Berge","year":"1957"},{"key":"10.1016\/0167-6377(94)90021-3_BIB2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01934690","article-title":"Fast parallel graph searching with applications","volume":"28","author":"Chaudhuri","year":"1988","journal-title":"BIT"},{"key":"10.1016\/0167-6377(94)90021-3_BIB3","series-title":"Parallel Algorithms: Design and Analysis","author":"Chaudhuri","year":"1992"},{"key":"10.1016\/0167-6377(94)90021-3_BIB4","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(94)90021-3_BIB5","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0167-6377(94)90021-3_BIB6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(94)90021-3_BIB7","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0020-0190(87)90193-1","article-title":"An O(n log log n) parallel maximum matching algorithm for bipartite graphs","volume":"24","author":"Kim","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6377(94)90021-3_BIB8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","article-title":"Parallel computation and conflicts in memory access","volume":"14","author":"Kucera","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6377(94)90021-3_BIB9","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/0196-6774(82)90013-X","article-title":"An O(n2log n) parallel max-flow algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:45Z","timestamp":1552902765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0167637794900213"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90021-3","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}