{"id":"https://openalex.org/W2047517090","doi":"https://doi.org/10.1137/0203015","title":"Optimum Communication Spanning Trees","display_name":"Optimum Communication Spanning Trees","publication_year":1974,"publication_date":"1974-09-01","ids":{"openalex":"https://openalex.org/W2047517090","doi":"https://doi.org/10.1137/0203015","mag":"2047517090"},"language":"en","primary_location":{"id":"doi:10.1137/0203015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203015","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/A5087577528","display_name":"T. C. Hu","orcid":"https://orcid.org/0009-0005-0844-7506"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"T. C. Hu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5087577528"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.3854,"has_fulltext":false,"cited_by_count":267,"citation_normalized_percentile":{"value":0.96780129,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"3","issue":"3","first_page":"188","last_page":"195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.9238446950912476},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7906935214996338},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7389007806777954},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.6905360221862793},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.666523277759552},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.6574565768241882},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.6432732343673706},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.6101061701774597},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5821094512939453},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5431370735168457},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5314974188804626},{"id":"https://openalex.org/keywords/reverse-delete-algorithm","display_name":"Reverse-delete algorithm","score":0.45846354961395264},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.44522541761398315},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4399870038032532},{"id":"https://openalex.org/keywords/k-minimum-spanning-tree","display_name":"k-minimum spanning tree","score":0.41163554787635803},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38190752267837524},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27961868047714233},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.27472883462905884},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.17340466380119324},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.12704652547836304},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11152371764183044}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.9238446950912476},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7906935214996338},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7389007806777954},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.6905360221862793},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.666523277759552},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.6574565768241882},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.6432732343673706},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.6101061701774597},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5821094512939453},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5431370735168457},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5314974188804626},{"id":"https://openalex.org/C199346575","wikidata":"https://www.wikidata.org/wiki/Q4925151","display_name":"Reverse-delete algorithm","level":4,"score":0.45846354961395264},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.44522541761398315},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4399870038032532},{"id":"https://openalex.org/C202750272","wikidata":"https://www.wikidata.org/wiki/Q6322849","display_name":"k-minimum spanning tree","level":5,"score":0.41163554787635803},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38190752267837524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27961868047714233},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.27472883462905884},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.17340466380119324},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.12704652547836304},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11152371764183044},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0203015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0203015","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"},{"id":"pmh:AD0771388","is_oa":false,"landing_page_url":"http://oai.dtic.mil/oai/oai?&verb=getRecord&metadataPrefix=html&identifier=AD0771388","pdf_url":null,"source":{"id":"https://openalex.org/S4406923043","display_name":"Defense Technical Information Center (DTIC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"DTIC AND NTIS","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.395.4768","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.395.4768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.informatik.hu-berlin.de/alkox/lehre/lvss12/ga/notes/GH_tree_application.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1551635709","https://openalex.org/W1965680834","https://openalex.org/W2017927472","https://openalex.org/W2044437461","https://openalex.org/W2064535593","https://openalex.org/W2115049345","https://openalex.org/W2149342630","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3016811403","https://openalex.org/W2943635264","https://openalex.org/W4380840098","https://openalex.org/W2099915933","https://openalex.org/W2387385213","https://openalex.org/W4308416203","https://openalex.org/W2418231958","https://openalex.org/W88291963","https://openalex.org/W2589768050","https://openalex.org/W2048177396"],"abstract_inverted_index":{"Given":[0],"a":[1,16,41,60,71],"set":[2,17],"of":[3,18,27,53,55,68,73,82,85,112,119,121],"nodes":[4,47,74],"$N_i":[5,31,93],"(i":[6],"=":[7],"1,2,":[8],"\\cdots":[9],",n)$":[10],"which":[11,22,87],"may":[12,23],"represent":[13,24],"cities":[14],"and":[15,33,95,140],"requirements":[19],"$r_{ij}":[20,76],"$":[21,32,77,94,97],"the":[25,36,50,56,80,83,89,99,116,122,127,132],"number":[26],"telephone":[28],"calls":[29],"between":[30],"$N_j":[34,96],"$,":[35],"problem":[37,128,136],"is":[38,59,75,129],"to":[39],"build":[40],"spanning":[42,57,64,100,123,134],"tree":[43,58,135],"connecting":[44,92],"these":[45],"n":[46,106],"such":[48],"that":[49,126],"total":[51,117],"cost":[52,67,118],"communication":[54,69,120],"minimum":[61,133],"among":[62],"all":[63,104],"trees.":[65],"The":[66],"for":[70],"pair":[72],"multiplied":[78],"by":[79,138],"sum":[81],"distances":[84],"arcs":[86],"form":[88],"unique":[90],"path":[91],"in":[98],"tree.":[101,124],"Summing":[102],"over":[103],"$\\begin{pmatrix}":[105],"\\\\":[107],"2":[108],"\\":[109],"\\end{pmatrix}$":[110],"pairs":[111],"nodes,":[113],"we":[114],"have":[115],"Note":[125],"different":[130],"from":[131],"solved":[137],"Kruskal":[139],"Prim.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}