{"id":"https://openalex.org/W2159620480","doi":"https://doi.org/10.1017/s0963548300002157","title":"An Efficient Method of Examining all Trees","display_name":"An Efficient Method of Examining all Trees","publication_year":1996,"publication_date":"1996-12-01","ids":{"openalex":"https://openalex.org/W2159620480","doi":"https://doi.org/10.1017/s0963548300002157","mag":"2159620480"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548300002157","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300002157","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5085143853","display_name":"Ewa Kubicka","orcid":null},"institutions":[{"id":"https://openalex.org/I142740786","display_name":"University of Louisville","ror":"https://ror.org/01ckdn478","country_code":"US","type":"education","lineage":["https://openalex.org/I142740786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ewa Kubicka","raw_affiliation_strings":["Department of Mathematics, University of Louisville, Louisville, Kentucky 40292, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Louisville, Louisville, Kentucky 40292, USA","institution_ids":["https://openalex.org/I142740786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085143853"],"corresponding_institution_ids":["https://openalex.org/I142740786"],"apc_list":null,"apc_paid":null,"fwci":0.9839,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.80466472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":"4","first_page":"403","last_page":"413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9150999784469604,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9150999784469604,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.7014245390892029},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.624011218547821},{"id":"https://openalex.org/keywords/wright","display_name":"Wright","score":0.6180979013442993},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5282403826713562},{"id":"https://openalex.org/keywords/section","display_name":"Section (typography)","score":0.5270419716835022},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5237831473350525},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5218262076377869},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.470101535320282},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4661629796028137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43566563725471497},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4159834384918213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2890942692756653},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.22811535000801086},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.12416672706604004}],"concepts":[{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.7014245390892029},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.624011218547821},{"id":"https://openalex.org/C2777667586","wikidata":"https://www.wikidata.org/wiki/Q8038170","display_name":"Wright","level":2,"score":0.6180979013442993},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5282403826713562},{"id":"https://openalex.org/C2780129039","wikidata":"https://www.wikidata.org/wiki/Q1931107","display_name":"Section (typography)","level":2,"score":0.5270419716835022},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5237831473350525},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5218262076377869},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.470101535320282},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4661629796028137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43566563725471497},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4159834384918213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2890942692756653},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.22811535000801086},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.12416672706604004},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548300002157","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548300002157","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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":9,"referenced_works":["https://openalex.org/W2030794273","https://openalex.org/W2049817705","https://openalex.org/W2063643785","https://openalex.org/W2068030953","https://openalex.org/W2076376787","https://openalex.org/W2123151743","https://openalex.org/W2291237591","https://openalex.org/W2296552784","https://openalex.org/W4205898702"],"related_works":["https://openalex.org/W2808195166","https://openalex.org/W2142190126","https://openalex.org/W2274794371","https://openalex.org/W4238119897","https://openalex.org/W2465787089","https://openalex.org/W2401402562","https://openalex.org/W188538620","https://openalex.org/W2888880683","https://openalex.org/W2415716132","https://openalex.org/W2037924346"],"abstract_inverted_index":{"In":[0,52,88],"this":[1],"paper,":[2],"we":[3,55,92],"present":[4,93],"a":[5,12,31,49,62,75,94,136,142,149],"techique":[6],"for":[7,25,43],"examining":[8,98],"all":[9,27,45,99],"trees":[10,29,47,100],"of":[11,30,48,65,69,97,112,119,127,145,148],"given":[13,32,50,83],"order.":[14,51],"Our":[15],"approach":[16],"is":[17,122,139],"based":[18],"on":[19,35],"the":[20,36,53,66,80,89,113,120,124,131,146],"Beyer":[21,85],"and":[22,34,40,86],"Hedetniemi":[23],"algorithm":[24,42,133],"generating":[26,44,104],"rooted":[28,76,137],"order":[33,147],"Wright,":[37],"Richmond,":[38],"Odlyzko":[39],"McKay":[41],"free":[46],"introduction":[54],"describe":[56],"these":[57,103],"algorithms.":[58,105],"We":[59],"also":[60],"give":[61],"precise":[63],"evaluation":[64],"average":[67,125],"number":[68,126],"moves":[70],"it":[71],"takes":[72],"to":[73,134],"generate":[74],"tree,":[77],"which":[78,101],"improves":[79],"upper":[81],"bound":[82],"by":[84,130,141],"Hedetniemi.":[87],"second":[90],"section":[91,108],"new":[95],"method":[96,114],"uses":[102],"The":[106,116],"last":[107],"contains":[109],"two":[110],"applications":[111],"introduced.":[115],"main":[117],"result":[118],"paper":[121],"that":[123],"steps":[128],"required":[129],"proposed":[132],"examine":[135],"tree":[138],"bounded":[140],"constant":[143],"independent":[144],"tree.":[150]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}