{"id":"https://openalex.org/W1971612468","doi":"https://doi.org/10.1137/0403006","title":"A Fast Perfect-Matching Algorithm in Random Graphs","display_name":"A Fast Perfect-Matching Algorithm in Random Graphs","publication_year":1990,"publication_date":"1990-02-01","ids":{"openalex":"https://openalex.org/W1971612468","doi":"https://doi.org/10.1137/0403006","mag":"1971612468"},"language":"en","primary_location":{"id":"doi:10.1137/0403006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0403006","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5040077103","display_name":"Olivier Goldschmidt","orcid":"https://orcid.org/0000-0002-6727-5565"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Olivier Goldschmidt","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085640376","display_name":"Dorit S. Hochbaum","orcid":"https://orcid.org/0000-0002-2498-0512"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dorit S. Hochbaum","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040077103"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4031,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88054513,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"1","first_page":"48","last_page":"57"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"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/combinatorics","display_name":"Combinatorics","score":0.7790852785110474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7578957080841064},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.6531324982643127},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5958822965621948},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5707094073295593},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5657655000686646},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5426225662231445},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5171017646789551},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.489898145198822},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.4171956479549408},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41266119480133057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35926055908203125}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7790852785110474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7578957080841064},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.6531324982643127},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5958822965621948},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5707094073295593},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5657655000686646},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5426225662231445},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5171017646789551},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.489898145198822},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.4171956479549408},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41266119480133057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35926055908203125},{"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/0403006","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0403006","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2017080670","https://openalex.org/W2061496873","https://openalex.org/W2111559003","https://openalex.org/W2150476282"],"related_works":["https://openalex.org/W2279830512","https://openalex.org/W3046990805","https://openalex.org/W3097369619","https://openalex.org/W2007715402","https://openalex.org/W4287691960","https://openalex.org/W2963181990","https://openalex.org/W2913663107","https://openalex.org/W2960354271","https://openalex.org/W2899261484","https://openalex.org/W2004524662"],"abstract_inverted_index":{"The":[0,31],"matching":[1,24],"problem":[2],"is":[3,18,38,47,58,67],"to":[4],"find":[5],"a":[6,14,22,26],"maximum":[7],"collection":[8],"of":[9,35,50,61,77,82],"mutually":[10],"nonadjacent":[11],"edges":[12],"in":[13,25,52],"graph.":[15],"An":[16],"algorithm":[17,37,81],"presented":[19],"that":[20],"delivers":[21],"perfect":[23],"random":[27],"graph":[28,54],"almost":[29],"surely.":[30],"expected":[32,74],"running":[33,65,75],"time":[34,66,76],"this":[36],"$O(":[39],"n":[40,46],"\\log_e":[41,71],"(1/p)":[42],"+":[43],"n)$,":[44,72],"where":[45,56],"the":[48,53,59,73,78],"number":[49],"vertices":[51],"and":[55,84],"p":[57],"probability":[60],"an":[62],"edge.":[63],"This":[64],"faster":[68],"than":[69],"$O(n":[70],"best":[79],"randomized":[80],"Angluin":[83],"Valiant.":[85]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}