{"id":"https://openalex.org/W4232849097","doi":"https://doi.org/10.1137/1.9781611973099.111","title":"A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs","display_name":"A Scaling Algorithm for Maximum Weight Matching in Bipartite Graphs","publication_year":2012,"publication_date":"2012-01-17","ids":{"openalex":"https://openalex.org/W4232849097","doi":"https://doi.org/10.1137/1.9781611973099.111"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973099.111","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101686889","display_name":"Ran Duan","orcid":"https://orcid.org/0000-0002-9696-9275"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ran Duan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hsin-Hao Su","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1413","last_page":"1424"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9929999709129333,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9902999997138977,"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.918113648891449},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6759693622589111},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6156095266342163},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5966697931289673},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.572677493095398},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5676304697990417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5608129501342773},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47156497836112976},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4674782454967499},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4289221465587616},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4128967821598053},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36903345584869385},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34993571043014526},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06821909546852112}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.918113648891449},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6759693622589111},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6156095266342163},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5966697931289673},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.572677493095398},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5676304697990417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5608129501342773},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47156497836112976},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4674782454967499},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4289221465587616},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4128967821598053},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36903345584869385},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34993571043014526},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06821909546852112},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973099.111","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973099.111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2174899211","https://openalex.org/W2091826982","https://openalex.org/W4400909662","https://openalex.org/W2921162226","https://openalex.org/W2036057584","https://openalex.org/W3022526073","https://openalex.org/W4246000090","https://openalex.org/W2107875203","https://openalex.org/W4234658180","https://openalex.org/W3098480989"],"abstract_inverted_index":{"Given":[0],"a":[1,14,24,73],"weighted":[2],"bipartite":[3],"graph,":[4],"the":[5,36,41,49,78],"maximum":[6,20],"weight":[7],"matching":[8],"(MWM)":[9],"problem":[10],"is":[11],"to":[12],"find":[13],"set":[15],"of":[16,43,52],"vertex-disjoint":[17],"edges":[18],"with":[19],"weight.":[21],"We":[22],"present":[23],"new":[25],"scaling":[26],"algorithm":[27],"that":[28],"runs":[29],"in":[30],"O(m\u221an":[31,57],"log":[32,58],"N)":[33],"time,":[34],"when":[35],"weights":[37],"are":[38],"integers":[39],"within":[40],"range":[42],"[0,":[44],"N].":[45],"The":[46],"result":[47],"improves":[48],"previous":[50],"bounds":[51],"O(Nm\u221an)":[53],"by":[54,60,81],"Gabow":[55,61],"and":[56,62,83],"(nN))":[59],"Tarjan":[63],"over":[64],"20":[65],"years":[66],"ago.":[67],"Our":[68],"improvement":[69],"draws":[70],"ideas":[71],"from":[72],"not":[74],"widely":[75],"known":[76],"result,":[77],"primal":[79],"method":[80],"Balinski":[82],"Gomory.":[84]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}