{"id":"https://openalex.org/W2551688242","doi":"https://doi.org/10.1145/3183369","title":"Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors","display_name":"Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors","publication_year":2018,"publication_date":"2018-06-22","ids":{"openalex":"https://openalex.org/W2551688242","doi":"https://doi.org/10.1145/3183369","mag":"2551688242"},"language":"en","primary_location":{"id":"doi:10.1145/3183369","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3183369","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3183369","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":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3183369","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001013961","display_name":"Harold N. Gabow","orcid":"https://orcid.org/0000-0002-9775-3492"},"institutions":[{"id":"https://openalex.org/I2802236040","display_name":"University of Colorado System","ror":"https://ror.org/00jc20583","country_code":"US","type":"education","lineage":["https://openalex.org/I2802236040"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Harold N. Gabow","raw_affiliation_strings":["University of Colorado at Boulder"],"affiliations":[{"raw_affiliation_string":"University of Colorado at Boulder","institution_ids":["https://openalex.org/I2802236040"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001013961"],"corresponding_institution_ids":["https://openalex.org/I2802236040"],"apc_list":null,"apc_paid":null,"fwci":2.7786,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.91295236,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"14","issue":"3","first_page":"1","last_page":"80"},"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.9995999932289124,"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.9973999857902527,"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.8826109170913696},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7742713689804077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7464452385902405},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6626126766204834},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5999505519866943},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44812390208244324},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4474742114543915},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.43024858832359314},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3687441945075989},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2053455412387848},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07050549983978271}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8826109170913696},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7742713689804077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7464452385902405},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6626126766204834},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5999505519866943},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44812390208244324},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4474742114543915},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.43024858832359314},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3687441945075989},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2053455412387848},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07050549983978271},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3183369","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3183369","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3183369","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":{"id":"doi:10.1145/3183369","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3183369","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3183369","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6805329777","display_name":null,"funder_award_id":"CCR-8815636","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":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2551688242.pdf","grobid_xml":"https://content.openalex.org/works/W2551688242.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W37994088","https://openalex.org/W136000211","https://openalex.org/W1513400187","https://openalex.org/W1655990431","https://openalex.org/W1866422804","https://openalex.org/W1977545325","https://openalex.org/W1982512167","https://openalex.org/W1999545213","https://openalex.org/W2005633226","https://openalex.org/W2007214900","https://openalex.org/W2008816808","https://openalex.org/W2011999472","https://openalex.org/W2023658462","https://openalex.org/W2028503265","https://openalex.org/W2040326319","https://openalex.org/W2041670460","https://openalex.org/W2041786457","https://openalex.org/W2054420170","https://openalex.org/W2066362074","https://openalex.org/W2084224084","https://openalex.org/W2090168101","https://openalex.org/W2091299439","https://openalex.org/W2124852572","https://openalex.org/W2125690626","https://openalex.org/W2129301137","https://openalex.org/W2143629726","https://openalex.org/W2156036190","https://openalex.org/W2222512263","https://openalex.org/W2290440076","https://openalex.org/W2327315803","https://openalex.org/W2340149117","https://openalex.org/W2427045451","https://openalex.org/W2484325476","https://openalex.org/W2550952896","https://openalex.org/W2988480584","https://openalex.org/W3145128584","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2054458431","https://openalex.org/W4367190712","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"This":[0,36,212],"article":[1,78],"shows":[2],"the":[3,29,77,94,98,108,132,164,174,189,192,206,231,296],"weighted":[4,87],"matching":[5],"problem":[6],"on":[7],"general":[8],"graphs":[9],"can":[10],"be":[11,202],"solved":[12],"in":[13,216,250],"time":[14,95,109,133,217,251],"O":[15,111,135,218,252,263],"(":[16,18,115,139,154,159,253,255],"n":[17,21,23,26,118,120,124,126,144,148,150,224,226,242,254,258,260,269,271],"m":[19,28,122,142,146,222,256,267],"+":[20,123,147,223,257,268],"log":[22,119,125,143,149,225,259,270],"))":[24,227,261,272],"for":[25,41,50,102,105,129,195,209,228],"and":[27,33,90,128,157,288],"number":[30],"of":[31,76,82,166,173,185,191,205,233,284,295],"vertices":[32],"edges,":[34],"respectively.":[35],"was":[37],"previously":[38,100,285],"known":[39,101,286],"only":[40,66],"bipartite":[42,103],"graphs.":[43],"The":[44,74,180],"crux":[45],"is":[46,97,110,134,199,214,248],"a":[47,55,203],"data":[48],"structure":[49,184,208,213],"blossom":[51,61,84,207],"creation.":[52],"It":[53],"uses":[54],"dynamic":[56],"nearest-common-ancestor":[57],"algorithm":[58,85,177],"to":[59,86,201],"simplify":[60],"steps,":[62],"so":[63],"they":[64],"involve":[65],"back":[67],"edges":[68,235],"rather":[69],"than":[70],"arbitrary":[71],"nontree":[72],"edges.":[73],"rest":[75],"presents":[79],"direct":[80],"extensions":[81],"Edmonds\u2019":[83],"b":[88,106,114,153],"-matching":[89,107],"f":[91,130,138,158,175,210,297],"-factors.":[92,211],"Again,":[93],"bound":[96],"one":[99],"graphs:":[104],"(min":[112,136],"{":[113,137],"V":[116,140,155,160],"),":[117,141],"}(":[121,145],")),":[127,151],"-factors":[131],"where":[152],")":[156,161],"both":[162],"denote":[163],"sum":[165],"all":[167,274,281],"degree":[168],"constraints.":[169],"Several":[170],"immediate":[171],"applications":[172],"-factor":[176,298],"are":[178,276,280,289],"given:":[179],"generalized":[181],"shortest":[182,245],"path":[183],"Reference":[186],"[19],":[187],"i.e.,":[188],"analog":[190],"shortest-paths":[193],"tree":[194],"conservative":[196],"undirected":[197],"graphs,":[198],"shown":[200],"version":[204],"found":[215,249],"(|":[219,264],"N":[220,229,239],"|(":[221,266],",":[230],"set":[232],"negative":[234],"(0":[236],"&lt;":[237,241],"|":[238,240],").":[243],"A":[244],"T":[246,265],"-join":[247],"or":[262],"when":[273],"costs":[275],"nonnegative.":[277],"These":[278],"bounds":[279],"slight":[282],"improvements":[283],"ones,":[287],"simply":[290],"achieved":[291],"by":[292],"proper":[293],"initialization":[294],"algorithm.":[299]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}