{"id":"https://openalex.org/W2093096530","doi":"https://doi.org/10.1080/00207169108804024","title":"Optimal multiway generalized split trees","display_name":"Optimal multiway generalized split trees","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W2093096530","doi":"https://doi.org/10.1080/00207169108804024","mag":"2093096530"},"language":"en","primary_location":{"id":"doi:10.1080/00207169108804024","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108804024","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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/A5004968111","display_name":"Gen-Huey Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]},{"id":"https://openalex.org/I99613584","display_name":"National Taipei University","ror":"https://ror.org/03e29r284","country_code":"TW","type":"education","lineage":["https://openalex.org/I99613584"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Gen-Huey Chen","raw_affiliation_strings":["\n Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China","Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China","institution_ids":["https://openalex.org/I16733864","https://openalex.org/I99613584"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China","institution_ids":["https://openalex.org/I16733864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006791415","display_name":"Lung-Tien Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I16733864","display_name":"National Taiwan University","ror":"https://ror.org/05bqach95","country_code":"TW","type":"education","lineage":["https://openalex.org/I16733864"]},{"id":"https://openalex.org/I99613584","display_name":"National Taipei University","ror":"https://ror.org/03e29r284","country_code":"TW","type":"education","lineage":["https://openalex.org/I99613584"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Lung-Tien Liu","raw_affiliation_strings":["\n Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China","Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China","institution_ids":["https://openalex.org/I16733864","https://openalex.org/I99613584"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China","institution_ids":["https://openalex.org/I16733864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.23427414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"41","issue":"1-2","first_page":"39","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9887999892234802,"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.9887999892234802,"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.9621999859809875,"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.9294999837875366,"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/mathematics","display_name":"Mathematics","score":0.7265089750289917},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6855655312538147},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6825549006462097},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.64436936378479},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.5278304219245911},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.49600276350975037},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49252066016197205},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.4359918236732483},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.4141734838485718},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.41340917348861694},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3753562569618225},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.37250590324401855},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36476850509643555}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7265089750289917},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6855655312538147},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6825549006462097},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.64436936378479},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.5278304219245911},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.49600276350975037},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49252066016197205},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.4359918236732483},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.4141734838485718},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.41340917348861694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3753562569618225},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.37250590324401855},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36476850509643555},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169108804024","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108804024","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","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":7,"referenced_works":["https://openalex.org/W1992695685","https://openalex.org/W2011508941","https://openalex.org/W2032579751","https://openalex.org/W2039536624","https://openalex.org/W2044317538","https://openalex.org/W2077383771","https://openalex.org/W2093708041"],"related_works":["https://openalex.org/W2038309235","https://openalex.org/W2364382882","https://openalex.org/W3169685561","https://openalex.org/W1979520615","https://openalex.org/W2501849745","https://openalex.org/W2072157347","https://openalex.org/W2061004850","https://openalex.org/W2004985727","https://openalex.org/W2949895650","https://openalex.org/W2091985989"],"abstract_inverted_index":{"Abstract":[0],"Split":[1],"trees":[2,51],"are":[3,21,52],"a":[4],"suitable":[5],"data":[6],"structure":[7],"for":[8],"storing":[9],"records":[10],"with":[11],"different":[12],"access":[13,27],"frequencies.":[14],"The":[15,97],"keys":[16,31,42],"in":[17,32,43],"the":[18,25,33,36,39,44,49],"root":[19,45],"node":[20,46],"required":[22],"to":[23,68,88],"have":[24,61],"highest":[26,40],"frequencies":[28],"among":[29],"all":[30],"tree.":[34],"If":[35],"requirement":[37],"of":[38,76],"frequency":[41],"is":[47],"ignored,":[48],"resulting":[50],"called":[53],"generalized":[54,73,92],"split":[55,74,93,107],"trees.":[56],"Previously,":[57],"Huang":[58,84],"and":[59,85],"Wong":[60],"designed":[62],"an":[63,70,89],"O(n":[64],"5)":[65],"time":[66],"algorithm":[67,99],"construct":[69],"optimal":[71],"binary":[72],"tree":[75],"size":[77],"n.":[78],"In":[79],"this":[80],"paper,":[81],"we":[82],"extend":[83],"Wong's":[86],"work":[87],"(m+":[90],"1)-way":[91],"tree,":[94],"where":[95],"m>1.":[96],"proposed":[98],"takes":[100],"o(n":[101],"5":[102],"m)time.":[103],"Keywords:":[104],"Dynamic":[105],"programminggeneralized":[106],"treessplit":[108],"treesC.R.Categories:":[109],"E.11.1.2":[110]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}