{"id":"https://openalex.org/W2782000683","doi":"https://doi.org/10.1145/3155301","title":"Scaling Algorithms for Weighted Matching in General Graphs","display_name":"Scaling Algorithms for Weighted Matching in General Graphs","publication_year":2018,"publication_date":"2018-01-03","ids":{"openalex":"https://openalex.org/W2782000683","doi":"https://doi.org/10.1145/3155301","mag":"2782000683"},"language":"en","primary_location":{"id":"doi:10.1145/3155301","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155301","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101897550","display_name":"Ran Duan","orcid":"https://orcid.org/0009-0007-0934-0684"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ran Duan","raw_affiliation_strings":["Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076564426","display_name":"Seth Pettie","orcid":"https://orcid.org/0000-0002-0495-3904"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Seth Pettie","raw_affiliation_strings":["University of Michigan, Ann Arbor, MI"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"institutions":[{"id":"https://openalex.org/I102149020","display_name":"University of North Carolina at Charlotte","ror":"https://ror.org/04dawnj30","country_code":"US","type":"education","lineage":["https://openalex.org/I102149020"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":["University of North Carolina, Charlotte, NC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of North Carolina, Charlotte, NC","institution_ids":["https://openalex.org/I102149020"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1473,"has_fulltext":false,"cited_by_count":50,"citation_normalized_percentile":{"value":0.96132058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"35"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/combinatorics","display_name":"Combinatorics","score":0.7864534258842468},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7480055093765259},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7050706148147583},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6292100548744202},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.6263411045074463},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.49796295166015625},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48831650614738464},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.48803654313087463},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.48501870036125183},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44550788402557373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41927826404571533},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4114694893360138},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16152331233024597},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07360494136810303},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07106101512908936}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7864534258842468},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7480055093765259},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7050706148147583},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6292100548744202},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6263411045074463},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.49796295166015625},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48831650614738464},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48803654313087463},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.48501870036125183},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44550788402557373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41927826404571533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4114694893360138},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16152331233024597},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07360494136810303},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07106101512908936},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3155301","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3155301","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4167357606","display_name":"AitF:Collaborative Research: Bridging the Gap between Theory and Practice for Matching and Edge Cover Problems","funder_award_id":"1637546","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W125735179","https://openalex.org/W136000211","https://openalex.org/W1602103078","https://openalex.org/W1969357318","https://openalex.org/W1973907457","https://openalex.org/W1978715699","https://openalex.org/W1981479258","https://openalex.org/W1999545213","https://openalex.org/W2003813631","https://openalex.org/W2028503265","https://openalex.org/W2029132631","https://openalex.org/W2040326319","https://openalex.org/W2041786457","https://openalex.org/W2047281923","https://openalex.org/W2054420170","https://openalex.org/W2059608229","https://openalex.org/W2084224084","https://openalex.org/W2090010485","https://openalex.org/W2090168101","https://openalex.org/W2091299439","https://openalex.org/W2098645185","https://openalex.org/W2123452111","https://openalex.org/W2124852572","https://openalex.org/W2125690626","https://openalex.org/W2149342630","https://openalex.org/W2151827175","https://openalex.org/W2164485560","https://openalex.org/W2327315803","https://openalex.org/W2395227458","https://openalex.org/W2401641833","https://openalex.org/W2493312408","https://openalex.org/W2568484534","https://openalex.org/W2605161051","https://openalex.org/W2624301084","https://openalex.org/W2796137918","https://openalex.org/W2951106886","https://openalex.org/W4233756358","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W3135784370","https://openalex.org/W4287273005","https://openalex.org/W2776473626","https://openalex.org/W4288411600","https://openalex.org/W2924623028","https://openalex.org/W1966028935","https://openalex.org/W1983915440","https://openalex.org/W3095925971","https://openalex.org/W2113270940","https://openalex.org/W2004283824"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,82],"new":[3],"scaling":[4],"algorithm":[5,19,84],"for":[6],"maximum":[7],"(or":[8],"minimum)":[9],"weight":[10],"perfect":[11],"matching":[12,48],"on":[13,50,81],"general,":[14],"edge":[15,76],"weighted":[16],"graphs.":[17],"Our":[18,78],"runs":[20,90],"in":[21,91],"O":[22,31,92],"(":[23,32,93,100],"m":[24,33,58,94,101],"\u221a":[25,34,95],"n":[26,35,60,96,98,103],"log(":[27,105],"nN":[28,106],"))":[29,107],"time,":[30],")":[36,104],"per":[37],"scale,":[38],"which":[39,89],"matches":[40],"the":[41,45,65],"running":[42],"time":[43],"of":[44,67,73,85],"best":[46],"cardinality":[47],"algorithms":[49],"sparse":[51],"graphs":[52],"[16,":[53],"20,":[54],"36,":[55],"37].":[56],"Here,":[57],",":[59,61,102],"and":[62,70,87],"N":[63],"bound":[64],"number":[66],"edges,":[68],"vertices,":[69],"magnitude,":[71],"respectively,":[72],"any":[74],"integer":[75],"weight.":[77],"result":[79],"improves":[80],"25-year-old":[83],"Gabow":[86],"Tarjan,":[88],"log":[97],"\u03b1":[99],"time.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}