{"id":"https://openalex.org/W1967086704","doi":"https://doi.org/10.1080/10637199408915464","title":"AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE\u2217","display_name":"AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE\u2217","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W1967086704","doi":"https://doi.org/10.1080/10637199408915464","mag":"1967086704"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915464","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915464","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/A5083232449","display_name":"C.N.K. Osiakwan","orcid":null},"institutions":[{"id":"https://openalex.org/I176714629","display_name":"Bell (Canada)","ror":"https://ror.org/00xdg8m59","country_code":"CA","type":"company","lineage":["https://openalex.org/I176714629"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"CONSTANTINE N. K. OSIAKWAN","raw_affiliation_strings":["Bell Northern Research , 3500 Coding Avenue, Ottawa, Ontario, K1Y 4H7, Canada"],"affiliations":[{"raw_affiliation_string":"Bell Northern Research , 3500 Coding Avenue, Ottawa, Ontario, K1Y 4H7, Canada","institution_ids":["https://openalex.org/I176714629"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041804050","display_name":"Selim G. Akl","orcid":"https://orcid.org/0000-0002-5742-9356"},"institutions":[{"id":"https://openalex.org/I176714629","display_name":"Bell (Canada)","ror":"https://ror.org/00xdg8m59","country_code":"CA","type":"company","lineage":["https://openalex.org/I176714629"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"SELIM G. AKL","raw_affiliation_strings":["Bell Northern Research , 3500 Coding Avenue, Ottawa, Ontario, K1Y 4H7, Canada"],"affiliations":[{"raw_affiliation_string":"Bell Northern Research , 3500 Coding Avenue, Ottawa, Ontario, K1Y 4H7, Canada","institution_ids":["https://openalex.org/I176714629"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083232449"],"corresponding_institution_ids":["https://openalex.org/I176714629"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11289148,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"3-4","first_page":"193","last_page":"210"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9995999932289124,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6484130620956421},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.635470986366272},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6146461367607117},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.580169677734375},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5532443523406982},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5327467918395996},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5326730012893677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5067594647407532},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5048351883888245},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.47771692276000977},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45961353182792664},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44344979524612427},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3928050696849823},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3625949025154114},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1500501036643982},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09440377354621887},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06434667110443115}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6484130620956421},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.635470986366272},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6146461367607117},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.580169677734375},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5532443523406982},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5327467918395996},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5326730012893677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5067594647407532},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5048351883888245},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.47771692276000977},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45961353182792664},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44344979524612427},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3928050696849823},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3625949025154114},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1500501036643982},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09440377354621887},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06434667110443115},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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.1080/10637199408915464","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915464","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":50,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1594991445","https://openalex.org/W1655990431","https://openalex.org/W1919479762","https://openalex.org/W1969543582","https://openalex.org/W1984735486","https://openalex.org/W1992060486","https://openalex.org/W1996358566","https://openalex.org/W2004389974","https://openalex.org/W2005314985","https://openalex.org/W2007052372","https://openalex.org/W2016406297","https://openalex.org/W2024106841","https://openalex.org/W2028365850","https://openalex.org/W2029360271","https://openalex.org/W2037752639","https://openalex.org/W2041883181","https://openalex.org/W2041963282","https://openalex.org/W2048659526","https://openalex.org/W2054621199","https://openalex.org/W2055674322","https://openalex.org/W2063301486","https://openalex.org/W2070164574","https://openalex.org/W2074584192","https://openalex.org/W2076088024","https://openalex.org/W2078629151","https://openalex.org/W2080090262","https://openalex.org/W2081385108","https://openalex.org/W2083694582","https://openalex.org/W2084224084","https://openalex.org/W2084362141","https://openalex.org/W2085697918","https://openalex.org/W2103283457","https://openalex.org/W2109560070","https://openalex.org/W2125690626","https://openalex.org/W2130566259","https://openalex.org/W2132026455","https://openalex.org/W2132648308","https://openalex.org/W2133226747","https://openalex.org/W2137377567","https://openalex.org/W2139559590","https://openalex.org/W2156372444","https://openalex.org/W2159008239","https://openalex.org/W2167937495","https://openalex.org/W2222512263","https://openalex.org/W2753176400","https://openalex.org/W2911302472","https://openalex.org/W4245266864","https://openalex.org/W4245614962","https://openalex.org/W4249958171"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2031630671","https://openalex.org/W2059382600","https://openalex.org/W2056770221","https://openalex.org/W2607998022"],"abstract_inverted_index":{"Abstract":[0],"We":[1,74],"consider":[2],"a":[3,76],"parallel":[4,38],"algorithm":[5,26,54,79],"for":[6,29,69],"minimum":[7],"weight":[8],"perfect":[9,77],"matching":[10],"on":[11,22,49],"complete":[12],"bipartite":[13],"graphs":[14],"induced":[15],"by":[16],"two":[17],"disjoint":[18],"sets":[19],"of":[20,37,44],"points":[21,48],"the":[23,30,50,53],"plane.":[24],"The":[25],"is":[27],"designed":[28],"EREW":[31,34],"PRAM":[32],"or":[33],"RPRAM":[35],"model":[36],"computation":[39],"with":[40],"p":[41,59,70,81],"(a":[42],"function":[43],"n)":[45],"processors.":[46],"For":[47],"Euclidean":[51],"plane,":[52],"executes":[55],"in":[56],"O(n":[57],"3/":[58],"2":[60],"+":[61,64],"n2log":[62],"n":[63,65],"2.5log":[66],"n/p)":[67],"time":[68],"<":[71],"equation":[72,82],"pending":[73,83],"achieve":[75],"speedup":[78],"when":[80]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}