{"id":"https://openalex.org/W2076376787","doi":"https://doi.org/10.1137/0209055","title":"Constant Time Generation of Rooted Trees","display_name":"Constant Time Generation of Rooted Trees","publication_year":1980,"publication_date":"1980-11-01","ids":{"openalex":"https://openalex.org/W2076376787","doi":"https://doi.org/10.1137/0209055","mag":"2076376787"},"language":"en","primary_location":{"id":"doi:10.1137/0209055","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209055","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on 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/A5059663649","display_name":"Terry Beyer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Terry Beyer","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111873665","display_name":"Sandra M. Hedetniemi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sandra Mitchell Hedetniemi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059663649"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3959,"has_fulltext":false,"cited_by_count":109,"citation_normalized_percentile":{"value":0.84660285,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"4","first_page":"706","last_page":"712"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9782000184059143,"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"}},"topics":[{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9782000184059143,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9574000239372253,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9524000287055969,"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/lexicographical-order","display_name":"Lexicographical order","score":0.8012239933013916},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7725695371627808},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.7284239530563354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7246541380882263},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.675636887550354},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5659224987030029},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5095074772834778},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42786917090415955},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42775407433509827},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2503111660480499},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.1948932409286499},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14193278551101685}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.8012239933013916},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7725695371627808},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7284239530563354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7246541380882263},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.675636887550354},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5659224987030029},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5095074772834778},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42786917090415955},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42775407433509827},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2503111660480499},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.1948932409286499},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14193278551101685},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/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.1137/0209055","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0209055","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1964195795","https://openalex.org/W2039339864","https://openalex.org/W2046448824","https://openalex.org/W2093386412","https://openalex.org/W2319000796","https://openalex.org/W3023780717","https://openalex.org/W3158027121","https://openalex.org/W4241645849","https://openalex.org/W4247557026"],"related_works":["https://openalex.org/W2117630634","https://openalex.org/W2486717996","https://openalex.org/W2374113901","https://openalex.org/W1964195795","https://openalex.org/W1982136501","https://openalex.org/W1971148082","https://openalex.org/W1998997565","https://openalex.org/W2023952630","https://openalex.org/W2060490057","https://openalex.org/W4241645849"],"abstract_inverted_index":{"This":[0],"paper":[1],"generalizes":[2],"a":[3,38],"result":[4],"of":[5,34,48],"Ruskey":[6],"[SIAM":[7],"J.":[8],"Comput.,":[9],"7(1978),":[10],"pp.":[11],"424\u2013439]":[12],"for":[13],"generating":[14,19],"k-ary":[15],"trees":[16,22,36],"lexicographically":[17],"to":[18],"all":[20],"rooted":[21],"with":[23],"n":[24],"vertices.":[25],"An":[26],"algorithm":[27],"is":[28,52],"presented":[29],"which":[30],"generates":[31],"canonical":[32],"representations":[33],"these":[35],"in":[37,42],"well-defined":[39],"order.":[40],"As":[41],"other":[43],"works,":[44],"the":[45],"average":[46],"number":[47],"steps":[49],"per":[50],"tree":[51],"constant.":[53]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2025-10-10T00:00:00"}