{"id":"https://openalex.org/W1996352825","doi":"https://doi.org/10.1142/s0129626499000335","title":"MINIMIZING THE DIAMETER IN TREE NETWORKS UNDER EDGE REDUCTIONS","display_name":"MINIMIZING THE DIAMETER IN TREE NETWORKS UNDER EDGE REDUCTIONS","publication_year":1999,"publication_date":"1999-09-01","ids":{"openalex":"https://openalex.org/W1996352825","doi":"https://doi.org/10.1142/s0129626499000335","mag":"1996352825"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626499000335","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000335","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5008726968","display_name":"Susanne E. Hambrusch","orcid":"https://orcid.org/0000-0003-0618-9732"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"SUSANNE E. HAMBRUSCH","raw_affiliation_strings":["Department of Computer Sciences, Purdue  University, West Lafayette, IN 47907, USA","Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA","Research supported in part by DARPA  under contract DABT63-92-C-0022ONR. The views and  conclusions contained in this paper are those of the authors and should  not be interpreted as representing official policies, expressed or implied,  of the U.S. government"],"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue  University, West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Research supported in part by DARPA  under contract DABT63-92-C-0022ONR. The views and  conclusions contained in this paper are those of the authors and should  not be interpreted as representing official policies, expressed or implied,  of the U.S. government","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111422462","display_name":"Hyeong-Seok Lim","orcid":null},"institutions":[{"id":"https://openalex.org/I111277659","display_name":"Chonnam National University","ror":"https://ror.org/05kzjxq56","country_code":"KR","type":"education","lineage":["https://openalex.org/I111277659"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"HYEONG-SEOK LIM","raw_affiliation_strings":["Department of Computer Science,  Chonnam National University, Kwangju, 500-757, Korea","Department of Computer Science, Chonnam National University, Kwangju, 500-757, Korea","Research supported in part by  Korea Research Foundation, 1996. Research was done while visiting Purdue  University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science,  Chonnam National University, Kwangju, 500-757, Korea","institution_ids":["https://openalex.org/I111277659"]},{"raw_affiliation_string":"Department of Computer Science, Chonnam National University, Kwangju, 500-757, Korea","institution_ids":["https://openalex.org/I111277659"]},{"raw_affiliation_string":"Research supported in part by  Korea Research Foundation, 1996. Research was done while visiting Purdue  University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008726968"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.17503265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"09","issue":"03","first_page":"361","last_page":"371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":1.0,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.995199978351593,"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/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.675016462802887},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6733821630477905},{"id":"https://openalex.org/keywords/tree-network","display_name":"Tree network","score":0.6085665225982666},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.604424238204956},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5600776076316833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5472287535667419},{"id":"https://openalex.org/keywords/broadcasting","display_name":"Broadcasting (networking)","score":0.5369756817817688},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.4375571012496948},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4258148670196533},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3952333331108093},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35797226428985596},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3372178375720978},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3169879913330078},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21970513463020325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19413554668426514},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.14147740602493286},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06882289052009583}],"concepts":[{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.675016462802887},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6733821630477905},{"id":"https://openalex.org/C2781010653","wikidata":"https://www.wikidata.org/wiki/Q12056602","display_name":"Tree network","level":3,"score":0.6085665225982666},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.604424238204956},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5600776076316833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5472287535667419},{"id":"https://openalex.org/C110157686","wikidata":"https://www.wikidata.org/wiki/Q922122","display_name":"Broadcasting (networking)","level":2,"score":0.5369756817817688},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.4375571012496948},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4258148670196533},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3952333331108093},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35797226428985596},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3372178375720978},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3169879913330078},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21970513463020325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19413554668426514},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.14147740602493286},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06882289052009583}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626499000335","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000335","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:docs.lib.purdue.edu:cstech-2410","is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/cstech/1411","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Computer Science Technical Reports","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2080750094","https://openalex.org/W2085961374","https://openalex.org/W2127486301"],"related_works":["https://openalex.org/W1719252778","https://openalex.org/W922283457","https://openalex.org/W2008276241","https://openalex.org/W2169820283","https://openalex.org/W2031098440","https://openalex.org/W2555545330","https://openalex.org/W1525759649","https://openalex.org/W4306705875","https://openalex.org/W1988133214","https://openalex.org/W2541390708"],"abstract_inverted_index":{"Edge":[0],"reductions":[1,21,82,104],"model":[2],"the":[3,28,31,41,57,61,85,94,97],"ability":[4],"of":[5,30,96,109],"speeding":[6],"up":[7],"communication":[8,53],"between":[9],"processors":[10],"in":[11,22,106],"a":[12,23,46,70,100,107],"network.":[13],"In":[14,48],"this":[15],"paper":[16],"we":[17,73],"consider":[18],"performing":[19],"edge":[20,81],"tree":[24,32,67,87],"network":[25],"so":[26],"that":[27,84],"diameter":[29,36,58,89,108],"is":[33,37,99],"minimized.":[34],"The":[35],"directly":[38],"related":[39],"to":[40,44,60,79],"time":[42,77],"needed":[43],"broadcast":[45],"message.":[47],"particular,":[49],"for":[50],"non-blocking":[51],"message":[52],"ignoring":[54],"start-up":[55],"costs,":[56],"corresponds":[59],"broadcasting":[62],"time.":[63],"For":[64],"an":[65,75],"n-vertex":[66],"T":[68],"and":[69,93],"quantity":[71],"B,":[72],"present":[74],"O(n)":[76],"algorithm":[78],"determine":[80],"such":[83],"resulting":[86,105],"has":[88],"at":[90,110],"most":[91,111],"B":[92],"cost":[95],"reduction":[98],"minimum":[101],"(over":[102],"all":[103],"B).":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}