{"id":"https://openalex.org/W2003813631","doi":"https://doi.org/10.1109/sfcs.1980.12","title":"An O(v|v| c |E|) algoithm for finding maximum matching in general graphs","display_name":"An O(v|v| c |E|) algoithm for finding maximum matching in general graphs","publication_year":1980,"publication_date":"1980-10-01","ids":{"openalex":"https://openalex.org/W2003813631","doi":"https://doi.org/10.1109/sfcs.1980.12","mag":"2003813631"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1980.12","doi":"https://doi.org/10.1109/sfcs.1980.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1980.12","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st Annual Symposium on Foundations of Computer Science (sfcs 1980)","raw_type":"proceedings-article"},"volume":null,"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/A5030198184","display_name":"Silvio M. Micali","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210155236","display_name":"National Research Council","ror":"https://ror.org/04zaypm56","country_code":"IT","type":"nonprofit","lineage":["https://openalex.org/I4210155236"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["IT","US"],"is_corresponding":false,"raw_author_name":"Silvio Micali","raw_affiliation_strings":["Consiglio Nazionale delle Ricerche, Italy","University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Consiglio Nazionale delle Ricerche, Italy","institution_ids":["https://openalex.org/I4210155236"]},{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007368382","display_name":"Vijay V. Vazirani","orcid":"https://orcid.org/0000-0002-4106-9077","observed_orcids":["https://orcid.org/0000-0002-4106-9077"]},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijay V. Vazirani","raw_affiliation_strings":["University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9694,"has_fulltext":false,"cited_by_count":823,"citation_normalized_percentile":{"value":0.86979167,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"17","last_page":"27"},"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.9940999746322632,"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.9940999746322632,"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.004000000189989805,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/maximum-matching","display_name":"maximum matching","score":0.9940000176429749},{"id":"https://openalex.org/keywords/general-graphs","display_name":"general graphs","score":0.9789999723434448},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"blossom algorithm","score":0.6240000128746033},{"id":"https://openalex.org/keywords/augmenting-paths","display_name":"augmenting paths","score":0.9769999980926514},{"id":"https://openalex.org/keywords/breadth-first-search-tree","display_name":"breadth-first search tree","score":0.7979999780654907},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.41499999165534973}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.795200765132904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6963678002357483},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6838831305503845},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6632673740386963},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5186564326286316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4821029007434845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46757203340530396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45020759105682373},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.4162929952144623},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4150412380695343},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3424926996231079},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09457355737686157},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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.1109/sfcs.1980.12","doi":"https://doi.org/10.1109/sfcs.1980.12","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1980.12","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st Annual Symposium on Foundations of Computer Science (sfcs 1980)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W33801284","https://openalex.org/W72083884","https://openalex.org/W2157529519","https://openalex.org/W2327315803","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W1968154277","https://openalex.org/W2129550502","https://openalex.org/W2009808060","https://openalex.org/W2093961518","https://openalex.org/W2372801012","https://openalex.org/W2009843927","https://openalex.org/W2361133696","https://openalex.org/W1553466895","https://openalex.org/W1995629993","https://openalex.org/W2092513144"],"abstract_inverted_index":{"In":[0,21,63],"this":[1],"paper":[2],"we":[3],"present":[4],"an":[5,57,130],"0(\u221a|V|\u00b7|E|)":[6],"algorithm":[7,17,67],"for":[8],"finding":[9],"a":[10,24,49,61,83,99,118,121,134],"maximum":[11],"matching":[12,38],"in":[13,19,47,97],"general":[14],"graphs.":[15],"This":[16],"works":[18],"'phases'.":[20],"each":[22,64],"phase":[23],"maximal":[25],"set":[26],"of":[27,52,60,82,108,116],"disjoint":[28],"minimum":[29,109],"length":[30],"augmenting":[31,104,131],"paths":[32],"is":[33,39,107],"found,":[34],"and":[35],"the":[36,66,80,89,95,102,114],"existing":[37],"increased":[40],"along":[41],"these":[42],"paths.":[43],"Our":[44],"contribution":[45],"consists":[46],"devising":[48],"special":[50,122],"way":[51,100],"handling":[53],"blossoms,":[54],"which":[55,125],"enables":[56,126],"O(|E|)":[58],"implementation":[59],"phase.":[62],"phase,":[65],"grows":[68],"Breadth":[69],"First":[70],"Search":[71],"trees":[72],"at":[73],"all":[74],"unmatched":[75],"vertices.":[76],"When":[77],"it":[78,85,93,112,127],"detects":[79],"presence":[81],"blossom,":[84],"does":[86],"not":[87],"'shrink'":[88],"blossom":[90,119,135],"immediately.":[91],"Instead,":[92],"delays":[94],"shrinking":[96,117],"such":[98],"that":[101],"first":[103],"path":[105,132],"found":[106],"length.":[110],"Furthermore,":[111],"achieves":[113],"effect":[115],"by":[120],"labeling":[123],"procedure":[124],"to":[128],"find":[129],"through":[133],"quickly.":[136]},"counts_by_year":[{"year":2026,"cited_by_count":12},{"year":2025,"cited_by_count":22},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":22},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":31},{"year":2019,"cited_by_count":23},{"year":2018,"cited_by_count":41},{"year":2017,"cited_by_count":22},{"year":2016,"cited_by_count":23},{"year":2015,"cited_by_count":50},{"year":2014,"cited_by_count":33},{"year":2013,"cited_by_count":39},{"year":2012,"cited_by_count":42}],"updated_date":"2026-10-18T09:31:52.927876","created_date":"2025-10-10T00:00:00"}