{"id":"https://openalex.org/W2145192475","doi":"https://doi.org/10.1145/1806689.1806697","title":"Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs","display_name":"Perfect matchings in o( <i>n</i> log <i>n</i> ) time in regular bipartite graphs","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2145192475","doi":"https://doi.org/10.1145/1806689.1806697","mag":"2145192475"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806697","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","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/A5101748190","display_name":"Ashish Goel","orcid":"https://orcid.org/0000-0003-0938-0401"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ashish Goel","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086773451","display_name":"Michael Kapralov","orcid":"https://orcid.org/0009-0006-2882-0459"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Kapralov","raw_affiliation_strings":["Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039619350","display_name":"Sanjeev Khanna","orcid":"https://orcid.org/0009-0000-2601-1689"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanjeev Khanna","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.9984999895095825,"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.8964478969573975},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8063061237335205},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5969889760017395},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.591702938079834},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5457425117492676},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.48230862617492676},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.44517782330513},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4313570261001587},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4212878942489624},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.2872815728187561},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.11945435404777527},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.048458635807037354}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8964478969573975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8063061237335205},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5969889760017395},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.591702938079834},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5457425117492676},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.48230862617492676},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.44517782330513},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4313570261001587},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4212878942489624},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2872815728187561},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.11945435404777527},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.048458635807037354},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1806689.1806697","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806697","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-second ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1971663478","https://openalex.org/W2004308928","https://openalex.org/W2019496833","https://openalex.org/W2036575499","https://openalex.org/W2047825085","https://openalex.org/W2053050060","https://openalex.org/W2067692201","https://openalex.org/W2120729889","https://openalex.org/W2124624165","https://openalex.org/W2134167260","https://openalex.org/W2157529519","https://openalex.org/W2165076510","https://openalex.org/W2170198451","https://openalex.org/W2295428206","https://openalex.org/W2493312408","https://openalex.org/W3017089570","https://openalex.org/W4237496336","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W113425656","https://openalex.org/W4293336311","https://openalex.org/W3143578817","https://openalex.org/W2736091028","https://openalex.org/W1995353327","https://openalex.org/W3023093332","https://openalex.org/W4297913876","https://openalex.org/W4246687640","https://openalex.org/W2951133863"],"abstract_inverted_index":{"In":[0,39,60],"this":[1],"paper":[2],"we":[3],"consider":[4],"the":[5,71],"well-studied":[6],"problem":[7],"of":[8,64],"finding":[9],"a":[10,14,44,61],"perfect":[11],"matching":[12,45],"in":[13,51],"d-regular":[15],"bipartite":[16,29,41],"graph":[17],"on":[18],"2n":[19],"nodes":[20],"with":[21],"m=nd":[22],"edges.":[23],"The":[24],"best-known":[25],"algorithm":[26],"for":[27],"general":[28],"graphs":[30],"(due":[31,54],"to":[32,48,55,78,85],"Hopcroft":[33],"and":[34,58,69,83],"Karp)":[35],"takes":[36],"time":[37,53,73],"O(m\u221an).":[38],"regular":[40],"graphs,":[42],"however,":[43],"is":[46],"known":[47],"be":[49],"computable":[50],"O(m)":[52,72],"Cole,":[56],"Ost,":[57],"Schirra).":[59],"recent":[62],"line":[63],"work":[65],"by":[66],"Goel,":[67],"Kapralov,":[68],"Khanna":[70],"bound":[74],"was":[75],"improved":[76],"first":[77],"~":[79],"O(min":[80],"m,":[81],"n2.5/d)":[82],"then":[84],"~O(min":[86],"{m,":[87],"n2/d\\}).":[88]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}