{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T14:14:37Z","timestamp":1673360077279},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0020-0190(93)90055-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"115-118","source":"Crossref","is-referenced-by-count":21,"title":["Approximating matchings in parallel"],"prefix":"10.1016","volume":"46","author":[{"given":"Ted","family":"Fischer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew V.","family":"Goldberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Haglin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Plotkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90055-E_BIB1","first-page":"325","article-title":"A random NC algorithm for depth first search","author":"Aggarwal","year":"1987","journal-title":"Proc. 19th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90055-E_BIB2","first-page":"297","article-title":"Parallel depth-first search in general directed graphs","author":"Aggarwal","year":"1989","journal-title":"Proc. 21st Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90055-E_BIB3","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986","journal-title":"Proc. 27th IEEE Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90055-E_BIB4","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978","journal-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90055-E_BIB5","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1989.63502","article-title":"Interior-point methods in parallel computation","author":"Goldberg","year":"1989"},{"key":"10.1016\/0020-0190(93)90055-E_BIB6","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/SFCS.1988.21935","article-title":"Sublinear-time parallel algorithms for matching and related problems","author":"Goldberg","year":"1988","journal-title":"Proc. 29th IEEE Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90055-E_BIB7","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0402028","article-title":"Constructing a maximal independent set in parallel","volume":"2","author":"Goldberg","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(93)90055-E_BIB8","article-title":"Results on matching, maximum cut, and related problems","author":"Haglin","year":"1989"},{"key":"10.1016\/0020-0190(93)90055-E_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An nbuilt52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90055-E_BIB10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579407","article-title":"Constructing a maximum matching is in Random NC","volume":"6","author":"Karp","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(93)90055-E_BIB11","author":"Lawler","year":"1976"},{"key":"10.1016\/0020-0190(93)90055-E_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(93)90055-E_BIB13","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/SFCS.1988.21934","article-title":"Removing randomness in parallel computation without a processor penalty","author":"Luby","year":"1988","journal-title":"Proc. 29th IEEE Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90055-E_BIB14","doi-asserted-by":"crossref","DOI":"10.1109\/SFCS.1989.63464","article-title":"Flow in planar graphs with multiple sources and sinks","author":"Miller","year":"1989","journal-title":"Proc. 30th IEEE Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90055-E_BIB15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579206","article-title":"Matching is as easy as matrix inversion","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(93)90055-E_BIB16","author":"Tarjan","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390055E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390055E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T10:39:09Z","timestamp":1580899149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390055E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["002001909390055E"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90055-e","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}