{"id":"https://openalex.org/W2157529519","doi":"https://doi.org/10.1137/0202019","title":"An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs","display_name":"An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs","publication_year":1973,"publication_date":"1973-12-01","ids":{"openalex":"https://openalex.org/W2157529519","doi":"https://doi.org/10.1137/0202019","mag":"2157529519"},"language":"en","primary_location":{"id":"doi:10.1137/0202019","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0202019","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5043211393","display_name":"John E. Hopcroft","orcid":"https://orcid.org/0000-0001-8681-6075"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"John E. Hopcroft","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068875104","display_name":"Richard M. Karp","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard M. Karp","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043211393"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.0947,"has_fulltext":false,"cited_by_count":2833,"citation_normalized_percentile":{"value":0.98320759,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"2","issue":"4","first_page":"225","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9988999962806702,"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.9988999962806702,"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/T12029","display_name":"DNA and Biological Computing","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8751437664031982},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6446040272712708},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46194157004356384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45955029129981995},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43937426805496216},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37562617659568787},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37340086698532104},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.21909216046333313}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8751437664031982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6446040272712708},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46194157004356384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45955029129981995},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43937426805496216},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37562617659568787},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37340086698532104},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21909216046333313},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0202019","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0202019","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2048652909","https://openalex.org/W2116353246","https://openalex.org/W2222512263","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2785998768","https://openalex.org/W2945016732","https://openalex.org/W2371352078","https://openalex.org/W2586280130","https://openalex.org/W4221143622","https://openalex.org/W4390409907","https://openalex.org/W2362975861"],"abstract_inverted_index":{"The":[0],"present":[1],"paper":[2],"shows":[3],"how":[4],"to":[5,27],"construct":[6],"a":[7,11,21],"maximum":[8],"matching":[9],"in":[10,20],"bipartite":[12],"graph":[13],"with":[14],"n":[15,31],"vertices":[16],"and":[17],"m":[18],"edges":[19],"number":[22],"of":[23],"computation":[24],"steps":[25],"proportional":[26],"$(m":[28],"+":[29],"n)\\sqrt":[30],"$.Keywordsalgorithmalgorithmic":[32],"analysisbipartite":[33],"graphscomputational":[34],"complexitygraphsmatching":[35]},"counts_by_year":[{"year":2026,"cited_by_count":14},{"year":2025,"cited_by_count":93},{"year":2024,"cited_by_count":72},{"year":2023,"cited_by_count":86},{"year":2022,"cited_by_count":89},{"year":2021,"cited_by_count":125},{"year":2020,"cited_by_count":99},{"year":2019,"cited_by_count":114},{"year":2018,"cited_by_count":152},{"year":2017,"cited_by_count":113},{"year":2016,"cited_by_count":111},{"year":2015,"cited_by_count":120},{"year":2014,"cited_by_count":121},{"year":2013,"cited_by_count":107},{"year":2012,"cited_by_count":101}],"updated_date":"2026-05-09T13:55:54.758798","created_date":"2025-10-10T00:00:00"}