{"id":"https://openalex.org/W1570679335","doi":"https://doi.org/10.1007/3-540-51859-2_22","title":"Optimal parallel algorithms for b-matchings in trees","display_name":"Optimal parallel algorithms for b-matchings in trees","publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W1570679335","doi":"https://doi.org/10.1007/3-540-51859-2_22","mag":"1570679335"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-51859-2_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-51859-2_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Constantine N. K. Osiakwan","raw_affiliation_strings":["Department of Computing and Information Science, Queen's University, K7L 3N6, Kingston, Ontario, Canada","Queen's University"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Information Science, Queen's University, K7L 3N6, Kingston, Ontario, Canada","institution_ids":["https://openalex.org/I204722609"]},{"raw_affiliation_string":"Queen's University","institution_ids":["https://openalex.org/I204722609"]}]},{"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/I204722609","display_name":"Queen's University","ror":"https://ror.org/02y72wh86","country_code":"CA","type":"education","lineage":["https://openalex.org/I204722609"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Selim G. Akl","raw_affiliation_strings":["Department of Computing and Information Science, Queen's University, K7L 3N6, Kingston, Ontario, Canada","Queen's University"],"affiliations":[{"raw_affiliation_string":"Department of Computing and Information Science, Queen's University, K7L 3N6, Kingston, Ontario, Canada","institution_ids":["https://openalex.org/I204722609"]},{"raw_affiliation_string":"Queen's University","institution_ids":["https://openalex.org/I204722609"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083232449"],"corresponding_institution_ids":["https://openalex.org/I204722609"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.2,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"274","last_page":"308"},"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.993399977684021,"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.993399977684021,"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.9807999730110168,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/computer-science","display_name":"Computer science","score":0.7415250539779663},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.7409113645553589},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6273213624954224},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6036215424537659},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5916200280189514},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5655065774917603},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5548791885375977},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4637985825538635},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4585537314414978},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41778916120529175},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39883625507354736},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2494194209575653}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7415250539779663},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.7409113645553589},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6273213624954224},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6036215424537659},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5916200280189514},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5655065774917603},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5548791885375977},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4637985825538635},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4585537314414978},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41778916120529175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39883625507354736},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2494194209575653},{"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.1007/3-540-51859-2_22","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-51859-2_22","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W119550570","https://openalex.org/W1484040084","https://openalex.org/W1530753374","https://openalex.org/W1581872756","https://openalex.org/W1655990431","https://openalex.org/W1982255740","https://openalex.org/W1993449345","https://openalex.org/W1996641400","https://openalex.org/W2002171526","https://openalex.org/W2044732624","https://openalex.org/W2053913299","https://openalex.org/W2059608229","https://openalex.org/W2074499935","https://openalex.org/W2081385108","https://openalex.org/W2090168101","https://openalex.org/W2109560070","https://openalex.org/W2118382442","https://openalex.org/W2125690626","https://openalex.org/W2130566259","https://openalex.org/W2156372444","https://openalex.org/W2159008239","https://openalex.org/W2171608071","https://openalex.org/W2427045451","https://openalex.org/W2433940709","https://openalex.org/W2577446513","https://openalex.org/W2752853835","https://openalex.org/W4233756358"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4389362338","https://openalex.org/W4299305030","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W2018076478","https://openalex.org/W1838063489"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}