{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T08:32:34Z","timestamp":1675758754588},"reference-count":13,"publisher":"Informa UK Limited","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1080\/10637199408915410","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T02:51:06Z","timestamp":1183776666000},"page":"115-121","source":"Crossref","is-referenced-by-count":2,"title":["PARALLEL APPROXIMATE MATCHING"],"prefix":"10.1080","volume":"2","author":[{"given":"THOMAS H.","family":"SPENCER","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.43.9.842"},{"key":"CIT0003","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd , Matrix multiplication via arithmetic progressions .Proc. 19th Annual ACM Symposium on Theory of Computing( 1987 ), 1 \u2013 6 .","DOI":"10.1145\/28395.28396"},{"key":"CIT0004","author":"Fischer T.","journal-title":"Information Processing Letters."},{"key":"CIT0005","doi-asserted-by":"crossref","unstructured":"H. Gabow and R. Tarjan , Almost optimal speed-ups of algorithms for matching and related problems .Proceedings of the 20th Annual ACM Symposium on Theory of Computing( 1988 ), 524 \u2013 527 .","DOI":"10.1145\/62212.62263"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"A. Goldberg , S. Plotkin , D. Shmoys and E. Tardos , Interior point methods in parallel computation .30th Symposium on Foundations of Computer Science( 1989 ), 350 \u2013 355 .","DOI":"10.1109\/SFCS.1989.63502"},{"key":"CIT0007","doi-asserted-by":"crossref","unstructured":"A. Goldberg , S. Plotkin and P. Vaidya , Sublinear-time parallel algorithms for matching and related problems .29th Symposium on Foundations of Computer Science( 1988 ), 174 \u2013 185 .","DOI":"10.1109\/SFCS.1988.21935"},{"key":"CIT0008","doi-asserted-by":"crossref","unstructured":"A. Goldberg and R. Tarjan , A new approach to the maximum flow problem .Proc. 18th Annual Symposium on Theory of Computing( 1986 ), 136 \u2013 146 .","DOI":"10.1145\/12130.12144"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90141-9"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579407"},{"key":"CIT0012","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","author":"Lev G.","year":"1981","journal-title":"IEEE Transactions on Computers"},{"key":"CIT0013","doi-asserted-by":"crossref","unstructured":"K. Mulmuley , U. Vazirani and V. Vazirani , Matching is as easy as matrix inversion .Proceedings of the 19th Annual ACM Symposium on Tlieory of Computing( 1987 ), 345 \u2013 354 .","DOI":"10.1145\/28395.383347"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1991.218187"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10637199408915410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T03:01:42Z","timestamp":1556593302000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10637199408915410"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["10.1080\/10637199408915410"],"URL":"https:\/\/doi.org\/10.1080\/10637199408915410","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}