{"id":"https://openalex.org/W1978630464","doi":"https://doi.org/10.1137/0210011","title":"Listing and Counting Subtrees of a Tree","display_name":"Listing and Counting Subtrees of a Tree","publication_year":1981,"publication_date":"1981-02-01","ids":{"openalex":"https://openalex.org/W1978630464","doi":"https://doi.org/10.1137/0210011","mag":"1978630464"},"language":"en","primary_location":{"id":"doi:10.1137/0210011","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210011","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/A5048017151","display_name":"Frank Ruskey","orcid":"https://orcid.org/0000-0001-5523-7185"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Frank Ruskey","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048017151"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1638,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.75652973,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"1","first_page":"141","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9973999857902527,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.666123628616333},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.643356204032898},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6157762408256531},{"id":"https://openalex.org/keywords/listing","display_name":"Listing (finance)","score":0.596522867679596},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5292068123817444},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.4946288764476776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47306597232818604},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.45983144640922546},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41902005672454834},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.4176337420940399},{"id":"https://openalex.org/keywords/range-tree","display_name":"Range tree","score":0.41662001609802246},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35767796635627747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34713757038116455},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.3087993562221527},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.29774385690689087},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.19551381468772888},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.10152190923690796}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.666123628616333},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.643356204032898},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6157762408256531},{"id":"https://openalex.org/C2779820595","wikidata":"https://www.wikidata.org/wiki/Q798505","display_name":"Listing (finance)","level":2,"score":0.596522867679596},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5292068123817444},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.4946288764476776},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47306597232818604},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.45983144640922546},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41902005672454834},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.4176337420940399},{"id":"https://openalex.org/C68775195","wikidata":"https://www.wikidata.org/wiki/Q818944","display_name":"Range tree","level":5,"score":0.41662001609802246},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35767796635627747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34713757038116455},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3087993562221527},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.29774385690689087},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.19551381468772888},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.10152190923690796},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","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},{"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/0210011","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210011","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":5,"referenced_works":["https://openalex.org/W195906706","https://openalex.org/W1131085401","https://openalex.org/W2039339864","https://openalex.org/W2067332418","https://openalex.org/W4241007652"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2351720606","https://openalex.org/W2125650843","https://openalex.org/W1999216101","https://openalex.org/W2007609084","https://openalex.org/W2084831204","https://openalex.org/W4288268215","https://openalex.org/W2489256354","https://openalex.org/W2061004850","https://openalex.org/W2072157347"],"abstract_inverted_index":{"Given":[0],"an":[1,5],"ordered":[2],"tree":[3,30],"T,":[4],"ordering":[6],"is":[7,56],"defined":[8],"on":[9],"the":[10,29,36,46,51,59],"set":[11],"of":[12,14,48,62],"subtrees":[13,22,63],"T.":[15,68],"Algorithms":[16],"are":[17],"presented":[18],"for":[19,27,58],"listing":[20],"all":[21,66],"in":[23,35,42,50],"that":[24],"order,":[25],"and":[26],"determining":[28],"occupying":[31],"a":[32],"given":[33,57],"position":[34],"list.":[37],"The":[38],"second":[39],"algorithm":[40],"runs":[41],"time":[43],"proportional":[44],"to":[45],"number":[47,61],"vertices":[49],"tree.":[52],"An":[53],"explicit":[54],"formula":[55],"total":[60],"summed":[64],"over":[65],"trees":[67]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}