{"id":"https://openalex.org/W2123452111","doi":null,"title":"Efficient algorithms for maximum weight matchings in general graphs with small edge weights","display_name":"Efficient algorithms for maximum weight matchings in general graphs with small edge weights","publication_year":2012,"publication_date":"2012-05-22","ids":{"openalex":"https://openalex.org/W2123452111","mag":"2123452111"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.7464","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.7464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epettie/matching/Huang-Kavitha-mwm-general-graphs-small-edge-weights.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5107269553","display_name":"Chien-Chung Huang","orcid":"https://orcid.org/0000-0003-3482-2646","observed_orcids":["https://orcid.org/0000-0003-3482-2646","https://orcid.org/0000-0001-5223-0770","https://orcid.org/0009-0007-8147-8653"]},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Chien-chung Huang","raw_affiliation_strings":["Humboldt-Universitat zu Berlin,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Humboldt-Universitat zu Berlin,Germany","institution_ids":["https://openalex.org/I39343248"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062523877","display_name":"Telikepalli Kavitha","orcid":"https://orcid.org/0000-0003-2619-6606","observed_orcids":["https://orcid.org/0000-0003-2619-6606"]},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Telikepalli Kavitha","raw_affiliation_strings":["Tata Institute of Fundamental Research (India)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research (India)","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4732,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.92964689,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9994999766349792,"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.9994999766349792,"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":9.999999747378752e-05,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-weighted-matching","display_name":"maximum weight matching","score":0.9990000128746033},{"id":"https://openalex.org/keywords/general-graphs","display_name":"general graphs","score":0.8569999933242798},{"id":"https://openalex.org/keywords/iterative-methods","display_name":"iterative methods","score":0.7269999980926514},{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","score":0.9929999709129333},{"id":"https://openalex.org/keywords/dense-graphs","display_name":"dense graphs","score":0.6480000019073486},{"id":"https://openalex.org/keywords/matrix-multiplication-exponent","display_name":"matrix multiplication exponent","score":0.7329999804496765}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7156800031661987},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6864238381385803},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6799464225769043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6367173790931702},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6288471221923828},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5807589292526245},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.5721782445907593},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4602014720439911},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4596310555934906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4551754295825958},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42487847805023193},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.41814202070236206},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4116429388523102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24274849891662598},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.1679527461528778},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.08727920055389404},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.054350465536117554},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.228.7464","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.228.7464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/%7Epettie/matching/Huang-Kavitha-mwm-general-graphs-small-edge-weights.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.591.6650","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.591.6650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~villars/work/small_weight.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W125735179","https://openalex.org/W136000211","https://openalex.org/W1494735819","https://openalex.org/W1499313444","https://openalex.org/W1551570706","https://openalex.org/W1592014028","https://openalex.org/W1769419289","https://openalex.org/W1969357318","https://openalex.org/W1972978715","https://openalex.org/W1973907457","https://openalex.org/W1977545325","https://openalex.org/W1979740015","https://openalex.org/W1981479258","https://openalex.org/W1985061810","https://openalex.org/W1992060486","https://openalex.org/W1999848117","https://openalex.org/W2003813631","https://openalex.org/W2028503265","https://openalex.org/W2037576616","https://openalex.org/W2054420170","https://openalex.org/W2058494699","https://openalex.org/W2059608229","https://openalex.org/W2076736619","https://openalex.org/W2084364487","https://openalex.org/W2085201606","https://openalex.org/W2090168101","https://openalex.org/W2091299439","https://openalex.org/W2111366547","https://openalex.org/W2126169247","https://openalex.org/W2145192475","https://openalex.org/W2157529519","https://openalex.org/W2163318198","https://openalex.org/W2164141517","https://openalex.org/W2166645359","https://openalex.org/W2222512263","https://openalex.org/W2244153394","https://openalex.org/W2327315803","https://openalex.org/W2335389215","https://openalex.org/W2536967169","https://openalex.org/W2988480584"],"related_works":["https://openalex.org/W1922780582","https://openalex.org/W7095524230","https://openalex.org/W1675653635","https://openalex.org/W4254890067","https://openalex.org/W2509353712","https://openalex.org/W3169697215","https://openalex.org/W7099092458","https://openalex.org/W1791617053","https://openalex.org/W2345548304","https://openalex.org/W2950751300"],"abstract_inverted_index":{"Let":[0],"G":[1],"=":[2,73,77,109],"(V,E)":[3],"be":[4],"a":[5,17,26,35,41],"graph":[6],"with":[7,68,107],"positive":[8],"integral":[9],"edge":[10,83],"weights.":[11],"Our":[12,112],"problem":[13,32,57],"is":[14,80,89],"to":[15],"find":[16],"matching":[18,38,49,56,119],"of":[19,92],"maximum":[20,36,47,54],"weight":[21,55],"in":[22,58,65],"G.":[23],"We":[24],"present":[25],"simple":[27],"iterative":[28],"algorithm":[29,100],"for":[30],"this":[31],"that":[33],"uses":[34],"cardinality":[37,48],"al-gorithm":[39],"as":[40],"subroutine.":[42],"Using":[43],"the":[44,53,81,90],"current":[45],"fastest":[46],"algorithms,":[50],"we":[51],"solve":[52],"O(W":[59],"nm":[60],"logn(n":[61],"2/m))":[62],"time,":[63],"or":[64],"O(Wn\u03c9)":[66],"time":[67],"high":[69],"probability,":[70],"where":[71],"n":[72],"|V":[74],"|,":[75],"m":[76],"|E|,":[78],"W":[79,108],"largest":[82],"weight,":[84],"and":[85,121],"\u03c9":[86],"<":[87],"2.376":[88],"exponent":[91],"matrix":[93],"multiplication.":[94],"In":[95],"relatively":[96],"dense":[97],"graphs,":[98],"our":[99],"performs":[101],"better":[102],"than":[103],"all":[104],"existing":[105],"al-gorithms":[106],"o(log1.5":[110],"n).":[111],"technique":[113],"hinges":[114],"on":[115],"exploiting":[116],"Edmonds":[117],"\u2019":[118],"polytope":[120],"its":[122],"dual.":[123],"1":[124]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-11-11T12:16:26.678958","created_date":"2016-06-24T00:00:00"}