{"id":"https://openalex.org/W2330997992","doi":"https://doi.org/10.1109/tpds.2016.2546258","title":"Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting","display_name":"Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting","publication_year":2016,"publication_date":"2016-03-24","ids":{"openalex":"https://openalex.org/W2330997992","doi":"https://doi.org/10.1109/tpds.2016.2546258","mag":"2330997992"},"language":"en","primary_location":{"id":"doi:10.1109/tpds.2016.2546258","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2546258","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/biblio/1379627","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013984574","display_name":"Ariful Azad","orcid":"https://orcid.org/0000-0003-1332-8630"},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ariful Azad","raw_affiliation_strings":["Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA"],"affiliations":[{"raw_affiliation_string":"Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA","institution_ids":["https://openalex.org/I148283060"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035719914","display_name":"Ayd\u0131n Bulu\u00e7","orcid":"https://orcid.org/0000-0001-7253-9038"},"institutions":[{"id":"https://openalex.org/I148283060","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I148283060","https://openalex.org/I39565521"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aydn Buluc","raw_affiliation_strings":["Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA"],"affiliations":[{"raw_affiliation_string":"Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA","institution_ids":["https://openalex.org/I148283060"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055182869","display_name":"Alex Pothen","orcid":"https://orcid.org/0000-0002-3421-3325"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alex Pothen","raw_affiliation_strings":["Department of Computer Science, Purdue University, West Lafayette, IN"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, West Lafayette, IN","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013984574"],"corresponding_institution_ids":["https://openalex.org/I148283060"],"apc_list":null,"apc_paid":null,"fwci":2.0271,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.90974979,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"28","issue":"1","first_page":"44","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8504461646080017},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.658476710319519},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6268922686576843},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5417803525924683},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5092800855636597},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.4375622570514679},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43471038341522217},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3940693438053131},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3272755742073059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3034980893135071},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13706251978874207}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8504461646080017},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.658476710319519},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6268922686576843},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5417803525924683},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5092800855636597},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.4375622570514679},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43471038341522217},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3940693438053131},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3272755742073059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3034980893135071},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13706251978874207},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tpds.2016.2546258","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tpds.2016.2546258","pdf_url":null,"source":{"id":"https://openalex.org/S97130795","display_name":"IEEE Transactions on Parallel and Distributed Systems","issn_l":"1045-9219","issn":["1045-9219","1558-2183","2161-9883"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems","raw_type":"journal-article"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt8kr0b6dd","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/8kr0b6dd","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Parallel and Distributed Systems, vol 28, iss 1","raw_type":"article"},{"id":"pmh:oai:osti.gov:1379627","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1379627","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:qt8kr0b6dd","is_oa":false,"landing_page_url":"http://www.escholarship.org/uc/item/8kr0b6dd","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Azad, A; Buluc, A; & Pothen, A. (2017). Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting. IEEE Transactions on Parallel and Distributed Systems, 28(1), 44 - 59. doi: 10.1109/TPDS.2016.2546258. Lawrence Berkeley National Laboratory: Lawrence Berkeley National Laboratory. Retrieved from: http://www.escholarship.org/uc/item/8kr0b6dd","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:osti.gov:1379627","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1379627","pdf_url":null,"source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1800366732","display_name":null,"funder_award_id":"1218196","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4329372222","display_name":null,"funder_award_id":"DE-FG02-13ER26135","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G7621587189","display_name":null,"funder_award_id":"1552323","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1501106692","https://openalex.org/W1563554946","https://openalex.org/W1969521151","https://openalex.org/W1973907457","https://openalex.org/W1994609277","https://openalex.org/W2009070933","https://openalex.org/W2021685712","https://openalex.org/W2035080386","https://openalex.org/W2038828004","https://openalex.org/W2048652909","https://openalex.org/W2053913299","https://openalex.org/W2060920449","https://openalex.org/W2061664364","https://openalex.org/W2066139250","https://openalex.org/W2069323107","https://openalex.org/W2069792133","https://openalex.org/W2081538566","https://openalex.org/W2083116175","https://openalex.org/W2090359754","https://openalex.org/W2093992309","https://openalex.org/W2101079780","https://openalex.org/W2104332310","https://openalex.org/W2118076222","https://openalex.org/W2141331848","https://openalex.org/W2142702167","https://openalex.org/W2149712598","https://openalex.org/W2157529519","https://openalex.org/W2163768829","https://openalex.org/W2408719245","https://openalex.org/W2467020497","https://openalex.org/W2501699529","https://openalex.org/W3013652274","https://openalex.org/W4239749705","https://openalex.org/W4299350514"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W4301329442","https://openalex.org/W2953390393","https://openalex.org/W2066405186","https://openalex.org/W4294093684","https://openalex.org/W1659690962","https://openalex.org/W2056770221","https://openalex.org/W1998998849"],"abstract_inverted_index":{"It":[0],"is":[1,32,100,188,226],"difficult":[2],"to":[3,144,190,198],"obtain":[4],"high":[5],"performance":[6,52,224],"when":[7,26],"computing":[8,56],"matchings":[9,59],"on":[10,109,201,229],"parallel":[11,210],"processors":[12],"because":[13],"matching":[14,233],"algorithms":[15,106,157,221],"explicitly":[16],"or":[17],"implicitly":[18],"search":[19,94],"for":[20,66,182],"paths":[21,28,68,147],"in":[22,55,60,158],"the":[23,103,122,136,154,161,166,172,219],"graph,":[24],"and":[25,45,53,171,197],"these":[27],"become":[29],"long,":[30],"there":[31],"little":[33],"concurrency.":[34],"In":[35],"spite":[36],"of":[37,121,130,160,163,174,180,193,215],"this":[38,128],"limitation,":[39],"we":[40],"present":[41],"a":[42,93,114,142,178],"new":[43],"algorithm":[44,64,140,150,211],"its":[46],"shared-memory":[47],"parallelization":[48],"that":[49,87,107,118],"achieves":[50],"good":[51],"scalability":[54],"maximum":[57],"cardinality":[58],"bipartite":[61],"graphs.":[62],"Our":[63,149,185],"searches":[65,72,90],"augmenting":[67,98,146,168],"via":[69],"specialized":[70],"breadth-first":[71],"(BFS)":[73],"from":[74,102,127],"multiple":[75],"source":[76,84],"vertices,":[77],"hence":[78],"creating":[79],"more":[80,227],"parallelism":[81],"than":[82,218],"single":[83],"algorithms.":[85],"Algorithms":[86],"employ":[88,135],"multiple-source":[89,131],"cannot":[91],"discard":[92],"tree":[95],"once":[96],"no":[97],"path":[99,169],"discovered":[101],"tree,":[104],"unlike":[105],"rely":[108],"single-source":[110],"searches.":[111,132],"We":[112,133,176],"describe":[113],"novel":[115],"tree-grafting":[116],"method":[117],"eliminates":[119],"most":[120],"redundant":[123],"edge":[124],"traversals":[125],"resulting":[126],"property":[129],"also":[134],"recent":[137],"direction-optimizing":[138],"BFS":[139],"as":[141],"subroutine":[143],"discover":[145],"faster.":[148],"compares":[151],"favorably":[152],"with":[153,231],"current":[155],"best":[156],"terms":[159],"number":[162,173],"edges":[164],"traversed,":[165],"average":[167],"length,":[170],"iterations.":[175],"provide":[177],"proof":[179],"correctness":[181],"our":[183,209],"algorithm.":[184],"NUMA-aware":[186],"implementation":[187],"scalable":[189],"80":[191],"threads":[192,200],"an":[194,202,213],"Intel":[195,203],"multiprocessor":[196],"240":[199],"Knights":[204],"Corner":[205],"coprocessor.":[206],"On":[207],"average,":[208],"runs":[212],"order":[214],"magnitude":[216],"faster":[217],"fastest":[220],"available.":[222],"The":[223],"improvement":[225],"significant":[228],"graphs":[230],"small":[232],"number.":[234]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}