{"id":"https://openalex.org/W2023492687","doi":"https://doi.org/10.1016/s0020-0190(00)00128-9","title":"Parallel approximation algorithms for maximum weighted matching in general graphs","display_name":"Parallel approximation algorithms for maximum weighted matching in general graphs","publication_year":2000,"publication_date":"2000-11-01","ids":{"openalex":"https://openalex.org/W2023492687","doi":"https://doi.org/10.1016/s0020-0190(00)00128-9","mag":"2023492687"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(00)00128-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(00)00128-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5054829031","display_name":"Ryuhei Uehara","orcid":"https://orcid.org/0000-0003-0895-3765"},"institutions":[{"id":"https://openalex.org/I72956036","display_name":"Komazawa University","ror":"https://ror.org/05tjaf288","country_code":"JP","type":"education","lineage":["https://openalex.org/I72956036"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Ryuhei Uehara","raw_affiliation_strings":["Komazawa University, Faculty of Natural Sciences, Komazawa 1-23-1, Setagaya-ku, Tokyo 154-8525, Japan","Natural Science Faculty, Komazawa University, Japan"],"affiliations":[{"raw_affiliation_string":"Komazawa University, Faculty of Natural Sciences, Komazawa 1-23-1, Setagaya-ku, Tokyo 154-8525, Japan","institution_ids":["https://openalex.org/I72956036"]},{"raw_affiliation_string":"Natural Science Faculty, Komazawa University, Japan","institution_ids":["https://openalex.org/I72956036"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101483230","display_name":"Zhi\u2010Zhong Chen","orcid":"https://orcid.org/0000-0003-3061-1171"},"institutions":[{"id":"https://openalex.org/I165522056","display_name":"Tokyo Denki University","ror":"https://ror.org/01pa62v70","country_code":"JP","type":"education","lineage":["https://openalex.org/I165522056"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Zhi-Zhong Chen","raw_affiliation_strings":["Department of Mathematical Sciences, Tokyo Denki University, Tokyo, Japan","Department of Mathematical Sciences, Tokyo Denki University, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tokyo Denki University, Tokyo, Japan","institution_ids":["https://openalex.org/I165522056"]},{"raw_affiliation_string":"Department of Mathematical Sciences, Tokyo Denki University, Japan","institution_ids":["https://openalex.org/I165522056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054829031"],"corresponding_institution_ids":["https://openalex.org/I72956036"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.4692,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.6604366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"76","issue":"1-2","first_page":"13","last_page":"17"},"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.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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.8188430070877075},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.686522364616394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6238890290260315},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5426419973373413},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5080042481422424},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.451369971036911},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.43636566400527954},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.42531687021255493},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.420853853225708},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4102340340614319},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.40515175461769104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38317710161209106},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2641039788722992}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.8188430070877075},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.686522364616394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6238890290260315},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5426419973373413},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5080042481422424},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.451369971036911},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.43636566400527954},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.42531687021255493},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.420853853225708},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4102340340614319},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.40515175461769104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38317710161209106},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2641039788722992},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0020-0190(00)00128-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(00)00128-9","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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":22,"referenced_works":["https://openalex.org/W1485041102","https://openalex.org/W1506378440","https://openalex.org/W1584086289","https://openalex.org/W1601937749","https://openalex.org/W1998129956","https://openalex.org/W1998375300","https://openalex.org/W2024106841","https://openalex.org/W2054420170","https://openalex.org/W2059608229","https://openalex.org/W2073975876","https://openalex.org/W2078003433","https://openalex.org/W2080090262","https://openalex.org/W2173502887","https://openalex.org/W2610729871","https://openalex.org/W2799004609","https://openalex.org/W3157585079","https://openalex.org/W4210638106","https://openalex.org/W4233756358","https://openalex.org/W6629004930","https://openalex.org/W6630400633","https://openalex.org/W6634962901","https://openalex.org/W6664029572"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2032550399","https://openalex.org/W2098281589","https://openalex.org/W2057791178","https://openalex.org/W2962917430","https://openalex.org/W2970302286","https://openalex.org/W1481223916","https://openalex.org/W2732982824","https://openalex.org/W1443174385"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2013,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}