{"id":"https://openalex.org/W2151348756","doi":"https://doi.org/10.1145/1721837.1721843","title":"Perfect matchings via uniform sampling in regular bipartite graphs","display_name":"Perfect matchings via uniform sampling in regular bipartite graphs","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2151348756","doi":"https://doi.org/10.1145/1721837.1721843","mag":"2151348756"},"language":"en","primary_location":{"id":"doi:10.1145/1721837.1721843","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721843","pdf_url":null,"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":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/I1743320","display_name":"Palo Alto University","ror":"https://ror.org/04f812k67","country_code":"US","type":"education","lineage":["https://openalex.org/I1743320"]},{"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, Palo Alto, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Palo Alto, CA","institution_ids":["https://openalex.org/I1743320","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/I1743320","display_name":"Palo Alto University","ror":"https://ror.org/04f812k67","country_code":"US","type":"education","lineage":["https://openalex.org/I1743320"]},{"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, Palo Alto, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University, Palo Alto, CA","institution_ids":["https://openalex.org/I1743320","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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6766,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.73146954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":"2","first_page":"1","last_page":"13"},"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.9997000098228455,"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.9997000098228455,"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.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.9986000061035156,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8299440145492554},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.786175549030304},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7335713505744934},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5736634731292725},{"id":"https://openalex.org/keywords/perfect-graph-theorem","display_name":"Perfect graph theorem","score":0.5269304513931274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.501389741897583},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4992716312408447},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4689597189426422},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.44858312606811523},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.44064977765083313},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.37903356552124023},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.21045124530792236},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.18752819299697876}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8299440145492554},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.786175549030304},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7335713505744934},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5736634731292725},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.5269304513931274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.501389741897583},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4992716312408447},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4689597189426422},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.44858312606811523},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.44064977765083313},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.37903356552124023},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.21045124530792236},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18752819299697876},{"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.1145/1721837.1721843","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1721837.1721843","pdf_url":null,"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":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G394840591","display_name":null,"funder_award_id":"339262","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G816287446","display_name":null,"funder_award_id":"CCF-0635084","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8410801952","display_name":null,"funder_award_id":"428868","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"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1494735819","https://openalex.org/W1971663478","https://openalex.org/W1981519953","https://openalex.org/W2004308928","https://openalex.org/W2045107949","https://openalex.org/W2053050060","https://openalex.org/W2068888615","https://openalex.org/W2120729889","https://openalex.org/W2124624165","https://openalex.org/W2125664420","https://openalex.org/W2157529519","https://openalex.org/W2165076510","https://openalex.org/W2170198451","https://openalex.org/W2223030445","https://openalex.org/W2295428206","https://openalex.org/W2493312408","https://openalex.org/W4231916799","https://openalex.org/W4389615664"],"related_works":["https://openalex.org/W3206289552","https://openalex.org/W3119766805","https://openalex.org/W1994363553","https://openalex.org/W4294024035","https://openalex.org/W2091485261","https://openalex.org/W2609475100","https://openalex.org/W2401632469","https://openalex.org/W4297800282","https://openalex.org/W2509813159","https://openalex.org/W2515819996"],"abstract_inverted_index":{"In":[0],"this":[1,83,98,114],"article":[2],"we":[3,123],"further":[4],"investigate":[5],"the":[6,42,47,52,59,149,165,237,259,264],"well-studied":[7],"problem":[8],"of":[9,44,54,61,164,194,204,274],"finding":[10,252],"a":[11,15,118,128,135,153,162,187,195,220],"perfect":[12,154,175,234],"matching":[13,155,196],"in":[14,35,46,127,199,207,219,255],"regular":[16],"bipartite":[17,131,256],"graph.":[18],"The":[19,64,159],"first":[20],"nontrivial":[21],"algorithm,":[22],"with":[23,134,156],"running":[24,84,266],"time":[25,70,85],"O":[26,87,105,139,238],"(":[27,106,140,239],"mn":[28],"),":[29],"dates":[30],"back":[31],"to":[32,76,86,172,192,226,246,276,286,292],"K\u00f6nig's":[33],"work":[34],"1916":[36],"(here":[37],"m":[38,89,240],"=":[39,138],"nd":[40],"is":[41,51,58,74,283],"number":[43,53],"edges":[45],"graph,":[48],"2":[49,146,294],"n":[50,91,94,107,110,141,143,242,295],"vertices,":[55],"and":[56,73,202,248],"d":[57,96,129,145],"degree":[60],"each":[62,125],"node).":[63],"currently":[65],"most":[66],"efficient":[67],"algorithm":[68,244],"takes":[69],"O(m)":[71],",":[72,90],"due":[75],"Cole":[77],"et":[78],"al.":[79],"[2001].":[80],"We":[81,112,184,268],"improve":[82],"(min{":[88],"2.5":[92],"ln":[93,142,293],"/":[95,144],"});":[97],"minimum":[99],"can":[100,222],"never":[101],"be":[102,224],"larger":[103],"than":[104],"1.75":[108],"\u221aln":[109],").":[111,296],"obtain":[113],"improvement":[115],"by":[116],"proving":[117],"uniform":[119,229,280],"sampling":[120,212,230,281],"theorem:":[121],"if":[122],"sample":[124],"edge":[126],"-regular":[130],"graph":[132,151,166,221,261],"independently":[133],"probability":[136],"p":[137],")":[147,243],"then":[148,185,262],"resulting":[150],"has":[152],"high":[157],"probability.":[158],"proof":[160],"involves":[161],"decomposition":[163],"into":[167],"pieces":[168],"which":[169],"are":[170],"guaranteed":[171],"have":[173,180],"many":[174],"matchings":[176,254],"but":[177],"do":[178],"not":[179],"any":[181,200],"small":[182],"cuts.":[183],"establish":[186],"correspondence":[188],"between":[189],"potential":[190],"witnesses":[191],"nonexistence":[193],"(after":[197],"sampling)":[198],"piece":[201],"cuts":[203,218],"comparable":[205],"size":[206],"that":[208,278],"same":[209],"piece.":[210],"Karger's":[211],"theorem":[213,231],"[1994a,":[214],"1994b]":[215],"for":[216,232,251],"preserving":[217,233],"now":[223],"adapted":[225],"prove":[227],"our":[228,279],"matchings.":[235],"Using":[236],"\u221a":[241],"(due":[245],"Hopcroft":[247],"Karp":[249],"[1973])":[250],"maximum":[253],"graphs":[257],"on":[258],"sampled":[260],"yields":[263],"stated":[265],"time.":[267],"also":[269],"provide":[270],"an":[271],"infinite":[272],"family":[273],"instances":[275],"show":[277],"result":[282],"tight":[284],"up":[285,291],"polylogarithmic":[287],"factors":[288],"(in":[289],"fact,":[290]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}