{"id":"https://openalex.org/W2119340899","doi":"https://doi.org/10.1080/10637199408915410","title":"PARALLEL APPROXIMATE MATCHING","display_name":"PARALLEL APPROXIMATE MATCHING","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2119340899","doi":"https://doi.org/10.1080/10637199408915410","mag":"2119340899"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915410","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915410","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5029058636","display_name":"Thomas H. Spencer","orcid":null},"institutions":[{"id":"https://openalex.org/I122266389","display_name":"University of Nebraska at Omaha","ror":"https://ror.org/04yrkc140","country_code":"US","type":"education","lineage":["https://openalex.org/I122266389"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"THOMAS H. SPENCER","raw_affiliation_strings":["Department of Mathematics and Computer Science , University of Nebraska and Omaha , Omaha, NE, 68182, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , University of Nebraska and Omaha , Omaha, NE, 68182, USA","institution_ids":["https://openalex.org/I122266389"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029058636"],"corresponding_institution_ids":["https://openalex.org/I122266389"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.18531345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":"1-2","first_page":"115","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9986000061035156,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9976000189781189,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9973000288009644,"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/matching","display_name":"Matching (statistics)","score":0.5252560973167419},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44384217262268066},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4245988428592682},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13416466116905212}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5252560973167419},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44384217262268066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4245988428592682},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13416466116905212}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408915410","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915410","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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":15,"referenced_works":["https://openalex.org/W1579753833","https://openalex.org/W1979740015","https://openalex.org/W1981234161","https://openalex.org/W1992060486","https://openalex.org/W1998375300","https://openalex.org/W2029131980","https://openalex.org/W2037752639","https://openalex.org/W2048652909","https://openalex.org/W2073975876","https://openalex.org/W2080063509","https://openalex.org/W2089828587","https://openalex.org/W2123806189","https://openalex.org/W2157529519","https://openalex.org/W2610729871","https://openalex.org/W4241977206"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596"],"abstract_inverted_index":{"Determining":[0],"the":[1,14,46,71],"parallel":[2,20,38,81],"complexity":[3],"of":[4,13,48,73,84,114,133],"maximum":[5,42,77,130],"cardinality":[6,43,78,131],"matching":[7,82,113,132],"in":[8,19,29,70,98],"bipartite":[9],"graphs":[10],"is":[11,25,139],"one":[12],"most":[15],"famous":[16],"open":[17],"problems":[18],"algorithm":[21,83,138],"design.":[22],"The":[23,80,136],"problem":[24,72],"known":[26,33],"to":[27],"be":[28,92],"RNC,":[30],"but":[31],"all":[32],"fast":[34],"(polylogarithmic":[35],"running":[36],"time)":[37],"algorithms":[39],"that":[40,95],"find":[41],"matchings":[44],"require":[45],"use":[47],"random":[49],"numbers.":[50],"Moreover,":[51],"they":[52,59],"are":[53,60,68],"based":[54],"on":[55,101],"matrix":[56],"algebra,":[57],"so":[58,94],"inherently":[61],"inefficient":[62],"for":[63],"sparse":[64],"graphs.":[65],"Therefore,":[66],"we":[67],"interested":[69],"finding":[74],"an":[75,102],"approximate":[76],"matching.":[79],"Goldberg,":[85],"Plotkin":[86],"and":[87,110,128],"Vaidya":[88],"(FOCS":[89],"1988)":[90],"can":[91],"modified":[93],"it":[96],"runs":[97],"O(a2log3n)":[99],"time":[100],"EREW":[103],"PRAM":[104],"with":[105,123],"n":[106,124],"+":[107],"m":[108,126],"processors":[109],"finds":[111],"a":[112,121,129],"size":[115,134],"(1":[116],"-":[117],"1/a)p":[118],"when":[119],"given":[120],"graph":[122],"vertices,":[125],"edges,":[127],"p.":[135],"resulting":[137],"deterministic.":[140]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}