{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:24Z","timestamp":1750307784719,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,13]],"date-time":"2011-11-13T00:00:00Z","timestamp":1321142400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,13]]},"DOI":"10.1145\/2089142.2089147","type":"proceedings-article","created":{"date-parts":[[2012,1,10]],"date-time":"2012-01-10T17:02:17Z","timestamp":1326214937000},"page":"11-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing maximum matching in parallel on bipartite graphs"],"prefix":"10.1145","author":[{"given":"Ariful","family":"Azad","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahantesh","family":"Halappanavar","sequence":"additional","affiliation":[{"name":"Pacific Northwest National Laboratory, Richland, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florin","family":"Dobrian","sequence":"additional","affiliation":[{"name":"Conviva Inc., San Mateo, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pothen","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049673.2049677"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479899358443"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202019"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198501626.001.0001","volume-title":"Fast parallel algorithms for graph matching problems","author":"Karpinski M.","year":"1998","unstructured":"M. Karpinski and W. Rytter . Fast parallel algorithms for graph matching problems . Oxford University Press, Inc. , New York, NY, USA , 1998 . M. Karpinski and W. Rytter. Fast parallel algorithms for graph matching problems. Oxford University Press, Inc., New York, NY, USA, 1998."},{"key":"e_1_3_2_1_5_1","volume-title":"Matching Theory (North-Holland mathematics studies)","author":"Lovasz L.","year":"1986","unstructured":"L. Lovasz . Matching Theory (North-Holland mathematics studies) . Elsevier Science Ltd , 1986 . L. Lovasz. Matching Theory (North-Holland mathematics studies). Elsevier Science Ltd, 1986."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1786194.1786276"},{"key":"e_1_3_2_1_7_1","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou C. H.","year":"1982","unstructured":"C. H. Papadimitriou and K. Steiglitz . Combinatorial Optimization: Algorithms and Complexity . Prentice-Hall, Inc. , Upper Saddle River, NJ, USA, 1982 . C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1982."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/98267.98287"}],"event":{"name":"SC '11: International Conference for High Performance Computing, Networking, Storage and Analysis","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture","IEEE CS"],"location":"Seattle Washington USA","acronym":"SC '11"},"container-title":["Proceedings of the 1st Workshop on Irregular Applications: Architectures and Algorithms"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2089142.2089147","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2089142.2089147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:10Z","timestamp":1750254970000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2089142.2089147"}},"subtitle":["worth the effort?"],"short-title":[],"issued":{"date-parts":[[2011,11,13]]},"references-count":8,"alternative-id":["10.1145\/2089142.2089147","10.1145\/2089142"],"URL":"https:\/\/doi.org\/10.1145\/2089142.2089147","relation":{},"subject":[],"published":{"date-parts":[[2011,11,13]]},"assertion":[{"value":"2011-11-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}