{"id":"https://openalex.org/W2128344524","doi":"https://doi.org/10.1109/ciss.2008.4558562","title":"A new approach to counting broadcast trees","display_name":"A new approach to counting broadcast trees","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2128344524","doi":"https://doi.org/10.1109/ciss.2008.4558562","mag":"2128344524"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2008.4558562","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-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/A5085268065","display_name":"Fulu Li","orcid":null},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fulu Li","raw_affiliation_strings":["MIT, Cambridge, MA, USA","MIT, Cambridge, Ma.#TAB#"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT, Cambridge, Ma.#TAB#","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100641549","display_name":"Kui Wu","orcid":"https://orcid.org/0000-0002-2069-0032"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Kui Wu","raw_affiliation_strings":["University of Victoria, Canada"],"affiliations":[{"raw_affiliation_string":"University of Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085268065"],"corresponding_institution_ids":["https://openalex.org/I4210110987","https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.3733,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63434424,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"413","last_page":"417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9970999956130981,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7901249527931213},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.7615220546722412},{"id":"https://openalex.org/keywords/bijection","display_name":"Bijection","score":0.7506107687950134},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7281978726387024},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.506761372089386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4846068322658539},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4532637596130371},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43994495272636414},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.43933457136154175},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3529598116874695},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.2015719711780548},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.07398125529289246}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7901249527931213},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.7615220546722412},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.7506107687950134},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7281978726387024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.506761372089386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4846068322658539},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4532637596130371},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43994495272636414},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.43933457136154175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3529598116874695},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.2015719711780548},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.07398125529289246},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2008.4558562","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322676","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W32262330","https://openalex.org/W1523142394","https://openalex.org/W1987139164","https://openalex.org/W1993449345","https://openalex.org/W2100803703","https://openalex.org/W2124565458","https://openalex.org/W2616697817","https://openalex.org/W2911361414","https://openalex.org/W2914659449","https://openalex.org/W4249708694","https://openalex.org/W6675236865","https://openalex.org/W6678530168"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W2406961474","https://openalex.org/W4300125793","https://openalex.org/W931334744","https://openalex.org/W2782899930","https://openalex.org/W2127599473","https://openalex.org/W1561326348","https://openalex.org/W2670612468","https://openalex.org/W4386921643","https://openalex.org/W2037924346"],"abstract_inverted_index":{"In":[0,51],"this":[1,70],"paper,":[2],"we":[3,53,74],"derive":[4],"the":[5,13,19,22,29,38,44,94],"formula":[6,61],"to":[7],"count":[8],"broadcast":[9],"trees":[10,89],"based":[11,36],"on":[12,37],"number":[14,39],"of":[15,24,40,58,80,87,93],"internal":[16,41],"nodes":[17,42],"in":[18,43,69],"tree.":[20],"To":[21],"best":[23],"our":[25],"knowledge,":[26],"it":[27],"is":[28,72],"first":[30],"time":[31],"that":[32,73],"tree":[33,45],"enumeration":[34],"formulas":[35],"have":[46],"been":[47],"explored":[48],"and":[49],"addressed.":[50],"addition,":[52],"give":[54],"a":[55,82],"new":[56],"proof":[57,71],"Cayley's":[59],"famous":[60],"for":[62],"counting":[63],"labeled":[64,88],"trees.":[65],"A":[66],"distinct":[67],"feature":[68],"purely":[75],"use":[76],"combinatorial":[77],"structures":[78],"instead":[79],"constructing":[81],"bijection":[83],"between":[84],"two":[85],"kinds":[86],"as":[90],"almost":[91],"all":[92],"existing":[95],"proofs":[96],"do":[97],"[1,7,8].":[98]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}