{"id":"https://openalex.org/W4241255862","doi":"https://doi.org/10.1080/10637199508915505","title":"AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER\u2217","display_name":"AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER\u2217","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W4241255862","doi":"https://doi.org/10.1080/10637199508915505"},"language":"en","primary_location":{"id":"doi:10.1080/10637199508915505","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10637199508915505","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1080/10637199508915505","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089431420","display_name":"Myung Ho Kim","orcid":"https://orcid.org/0000-0002-1933-7987"},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]},{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"MYUNG-HO KIM","raw_affiliation_strings":["Parallel Programming Section, ETRI, 161 Kajong-Dong, Yusong-Gu, TaeJon, 305-350, Korea","Parallel Programming Section, ETRI , 161 Kajong-Dong, Yusong-Gu, TaeJon, 305-350, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Parallel Programming Section, ETRI, 161 Kajong-Dong, Yusong-Gu, TaeJon, 305-350, Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Parallel Programming Section, ETRI , 161 Kajong-Dong, Yusong-Gu, TaeJon, 305-350, Korea","institution_ids":["https://openalex.org/I142401562"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039944209","display_name":"Chang\u2010Sung Jeong","orcid":"https://orcid.org/0000-0001-9654-8406"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"CHANG-SUNG JEONG","raw_affiliation_strings":["Department of Electronics Engineering, Korea University, 1, 5-ka, Anam-dong, Sungbuk-ku, Seoul 136, Korea","Department of Electronics Engineering , Korea University , 1,5-ka, Anam-dong, Sungbuk-ku, Seoul 136, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, Korea University, 1, 5-ka, Anam-dong, Sungbuk-ku, Seoul 136, Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"Department of Electronics Engineering , Korea University , 1,5-ka, Anam-dong, Sungbuk-ku, Seoul 136, Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.40828211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"2-3","first_page":"129","last_page":"141"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9994999766349792,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.802020788192749},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.739210307598114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6379485130310059},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.523944616317749},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.48552799224853516},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4705759882926941},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4255695641040802},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.4143093228340149},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3919737935066223},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3596382141113281},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.33599480986595154},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2717354893684387}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.802020788192749},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.739210307598114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6379485130310059},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.523944616317749},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.48552799224853516},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4705759882926941},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4255695641040802},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4143093228340149},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3919737935066223},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3596382141113281},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.33599480986595154},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2717354893684387},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199508915505","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10637199508915505","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1080/10637199508915505","is_oa":true,"landing_page_url":"https://doi.org/10.1080/10637199508915505","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W2008908074","https://openalex.org/W2031966632","https://openalex.org/W2054806836","https://openalex.org/W2061080407","https://openalex.org/W2081942300"],"related_works":["https://openalex.org/W2352066879","https://openalex.org/W2348257368","https://openalex.org/W2054458431","https://openalex.org/W2184969544","https://openalex.org/W2371352078","https://openalex.org/W1592682627","https://openalex.org/W2080136900","https://openalex.org/W4295762832","https://openalex.org/W2999621586","https://openalex.org/W4232683556"],"abstract_inverted_index":{"In":[0],"this":[1,26],"paper,":[2],"we":[3],"address":[4],"the":[5,37],"problem":[6],"of":[7],"finding":[8],"a":[9,13,18],"maximum":[10],"matching":[11],"for":[12],"convex":[14],"bipartite":[15],"graph":[16],"on":[17,33],"mesh-connected":[19],"computer":[20],"(MCC).":[21],"We":[22],"shall":[23],"show":[24],"that":[25],"can":[27],"be":[28],"done":[29],"in":[30,43],"optimal":[31],"time":[32],"MCC":[34],"by":[35],"designing":[36],"efficient":[38],"merge":[39],"and":[40,45],"division":[41],"schemes":[42],"bottom-up":[44],"top-down":[46],"approach":[47],"respectively.":[48]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}