{"id":"https://openalex.org/W3047208409","doi":"https://doi.org/10.1137/18m1189348","title":"A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs","display_name":"A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3047208409","doi":"https://doi.org/10.1137/18m1189348","mag":"3047208409"},"language":"en","primary_location":{"id":"doi:10.1137/18m1189348","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1189348","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1801.09809","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ariful Azad","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ariful Azad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Aydin Bulu\u00e7","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aydin Bulu\u00e7","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Xiaoye S. Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaoye S. Li","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Xinliang Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xinliang Wang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Johannes Langguth","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johannes Langguth","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7339,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.88187379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"42","issue":"4","first_page":"C143","last_page":"C168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.789900004863739,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.789900004863739,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.028999999165534973,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.02160000056028366,"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/bipartite-graph","display_name":"Bipartite graph","score":0.7526999711990356},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6915000081062317},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6539999842643738},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.46860000491142273},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.43709999322891235},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.38420000672340393},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.38040000200271606},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.37540000677108765}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7526999711990356},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6915000081062317},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6539999842643738},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5336999893188477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5295000076293945},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.46860000491142273},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.43709999322891235},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.38420000672340393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3817000091075897},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.38040000200271606},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.37540000677108765},{"id":"https://openalex.org/C83283714","wikidata":"https://www.wikidata.org/wiki/Q121117","display_name":"Supercomputer","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.33980000019073486},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C91481028","wikidata":"https://www.wikidata.org/wiki/Q1054686","display_name":"Distributed memory","level":3,"score":0.33219999074935913},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.32030001282691956},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.30799999833106995},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.29809999465942383},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28060001134872437}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/18m1189348","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1189348","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1801.09809","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.09809","pdf_url":"https://arxiv.org/pdf/1801.09809","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:escholarship.org:ark:/13030/qt7403v6r9","is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/7403v6r9","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":"SIAM Journal on Scientific Computing, vol 42, iss 4","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1801.09809","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1801.09809","pdf_url":"https://arxiv.org/pdf/1801.09809","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3232922872","display_name":null,"funder_award_id":"17-SC-20-SC","funder_id":"https://openalex.org/F4320332369","funder_display_name":"National Nuclear Security Administration"}],"funders":[{"id":"https://openalex.org/F4320332369","display_name":"National Nuclear Security Administration","ror":"https://ror.org/03sk1we31"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1541277988","https://openalex.org/W1879973584","https://openalex.org/W1966476169","https://openalex.org/W2000678922","https://openalex.org/W2014533003","https://openalex.org/W2041785146","https://openalex.org/W2057750651","https://openalex.org/W2060920449","https://openalex.org/W2061664364","https://openalex.org/W2065607954","https://openalex.org/W2069849438","https://openalex.org/W2080353445","https://openalex.org/W2089353209","https://openalex.org/W2090359754","https://openalex.org/W2093832225","https://openalex.org/W2093992309","https://openalex.org/W2101079780","https://openalex.org/W2104332310","https://openalex.org/W2106822689","https://openalex.org/W2141331848","https://openalex.org/W2141380216","https://openalex.org/W2157529519","https://openalex.org/W2222512263","https://openalex.org/W2330997992","https://openalex.org/W2407068241","https://openalex.org/W2782000683"],"related_works":[],"abstract_inverted_index":{"We":[0],"design":[1],"and":[2,102,160],"implement":[3],"an":[4],"efficient":[5,143],"parallel":[6,92],"algorithm":[7,95,135,147],"for":[8,38,114],"finding":[9,50],"a":[10,14,90,99,156,172],"perfect":[11,75,100,110,130],"matching":[12,26,36,76,101,111],"in":[13,53,82,120],"weighted":[15],"bipartite":[16],"graph":[17],"such":[18,78],"that":[19,96,164],"weights":[20,127],"on":[21,155],"the":[22,25,33,62,106,109,126,129,140,146,176],"edges":[23],"of":[24,64,72,108,117,128,145],"are":[27,43,136,165],"large.":[28],"This":[29],"problem":[30],"differs":[31],"from":[32],"maximum":[34,73],"weight":[35,74,107],"problem,":[37],"which":[39],"scalable":[40,54,65],"approximation":[41],"algorithms":[42],"known.":[44],"It":[45],"is":[46],"primarily":[47],"motivated":[48],"by":[49,112,133,171],"good":[51],"pivots":[52],"sparse":[55],"direct":[56],"solvers":[57,68],"before":[58],"factorization.":[59],"Due":[60],"to":[61,139,150,168],"lack":[63],"alternatives,":[66],"distributed":[67,93],"use":[69],"sequential":[70,177],"implementations":[71],"algorithms,":[77],"as":[79],"those":[80],"available":[81],"MC64.":[83],"To":[84],"overcome":[85],"this":[86],"limitation,":[87],"we":[88],"propose":[89],"fully":[91],"memory":[94],"first":[97],"generates":[98],"then":[103],"iteratively":[104],"improves":[105],"searching":[113],"weight-increasing":[115],"cycles":[116],"length":[118],"4":[119],"parallel.":[121],"For":[122],"most":[123],"practical":[124],"problems":[125],"matchings":[131],"generated":[132],"our":[134],"very":[137],"close":[138],"optimum.":[141],"An":[142],"implementation":[144],"scales":[148],"up":[149],"256":[151],"nodes":[152],"(17,408":[153],"cores)":[154],"Cray":[157],"XC40":[158],"supercomputer":[159],"can":[161],"solve":[162],"instances":[163],"too":[166],"large":[167],"be":[169],"handled":[170],"single":[173],"node":[174],"using":[175],"algorithm.":[178]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2020-08-10T00:00:00"}