{"id":"https://openalex.org/W3024690918","doi":"https://doi.org/10.1109/drcn48652.2020.1570613458","title":"On the Number of Steiner Trees in a Graph","display_name":"On the Number of Steiner Trees in a Graph","publication_year":2020,"publication_date":"2020-03-01","ids":{"openalex":"https://openalex.org/W3024690918","doi":"https://doi.org/10.1109/drcn48652.2020.1570613458","mag":"3024690918"},"language":"en","primary_location":{"id":"doi:10.1109/drcn48652.2020.1570613458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn48652.2020.1570613458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","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/A5112073042","display_name":"A. Sen","orcid":"https://orcid.org/0009-0006-3877-7255"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Sen","raw_affiliation_strings":["SCIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"SCIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064272385","display_name":"Chenyang Zhou","orcid":"https://orcid.org/0000-0003-0796-0787"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Zhou","raw_affiliation_strings":["SCIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"SCIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113903638","display_name":"Arpan Chandra Mazumder","orcid":"https://orcid.org/0009-0005-9527-6150"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Mazumder","raw_affiliation_strings":["SCIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"SCIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043873182","display_name":"Arun Das","orcid":"https://orcid.org/0000-0003-2559-6763"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Das","raw_affiliation_strings":["SCIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"SCIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103057643","display_name":"Kaustav Basu","orcid":"https://orcid.org/0000-0002-3705-055X"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Basu","raw_affiliation_strings":["SCIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"SCIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027153286","display_name":"Krzysztof Walkowiak","orcid":"https://orcid.org/0000-0003-1686-3110"},"institutions":[{"id":"https://openalex.org/I11923345","display_name":"Wroc\u0142aw University of Science and Technology","ror":"https://ror.org/008fyn775","country_code":"PL","type":"education","lineage":["https://openalex.org/I11923345"]},{"id":"https://openalex.org/I686019","display_name":"AGH University of Krakow","ror":"https://ror.org/00bas1c41","country_code":"PL","type":"education","lineage":["https://openalex.org/I686019"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"K. Walkowiak","raw_affiliation_strings":["Wroclaw University of Science and Technology, Poland"],"affiliations":[{"raw_affiliation_string":"Wroclaw University of Science and Technology, Poland","institution_ids":["https://openalex.org/I11923345","https://openalex.org/I686019"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5112073042"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06687032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"479","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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":0.9997000098228455,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9993000030517578,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9975000023841858,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.9020568132400513},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8086888790130615},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7901391983032227},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6486074328422546},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.6467338800430298},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.6097633838653564},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5646265149116516},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5440598726272583},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5259630680084229},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49348580837249756},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4905380606651306},{"id":"https://openalex.org/keywords/connectivity","display_name":"Connectivity","score":0.4790978729724884},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38493970036506653},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13624709844589233},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.06251594424247742}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.9020568132400513},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8086888790130615},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7901391983032227},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6486074328422546},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.6467338800430298},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.6097633838653564},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5646265149116516},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5440598726272583},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5259630680084229},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49348580837249756},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4905380606651306},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.4790978729724884},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38493970036506653},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13624709844589233},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.06251594424247742},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/drcn48652.2020.1570613458","is_oa":false,"landing_page_url":"https://doi.org/10.1109/drcn48652.2020.1570613458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 16th International Conference on the Design of Reliable Communication Networks DRCN 2020","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1554127434","https://openalex.org/W2001749541","https://openalex.org/W2011924202","https://openalex.org/W2076379235","https://openalex.org/W2616697817","https://openalex.org/W2900640049","https://openalex.org/W6650729305","https://openalex.org/W6653682555","https://openalex.org/W6755884405"],"related_works":["https://openalex.org/W4301179398","https://openalex.org/W2487945693","https://openalex.org/W2043958520","https://openalex.org/W2437037494","https://openalex.org/W2307044859","https://openalex.org/W2052473415","https://openalex.org/W2779648845","https://openalex.org/W2095369952","https://openalex.org/W2075810525","https://openalex.org/W3019213358"],"abstract_inverted_index":{"In":[0,86,134,245],"a":[1,13,31,42,70,79,159,172,208,235,251,260,300,323],"number":[2,32,72,83,153,230,255,286],"of":[3,27,33,73,120,136,154,158,175,198,202,210,220,231,256,259,279,287,299,312,329],"networking":[4,59],"problems,":[5],"one":[6,89,125,164,187,283,293],"needs":[7,126,188],"to":[8,91,127,142,166,189,206],"find":[9,207],"multiple":[10,18,168],"paths":[11,40],"between":[12,41],"source-destination":[14,44],"node":[15,45],"pair":[16],"or":[17],"trees":[19,110,169,192],"spanning":[20,170],"all":[21,295],"(or":[22],"some":[23],"of)":[24],"the":[25,28,100,115,152,195,214,218,229,254,281,285,291,296,313,319,336,348],"nodes":[26,240,305],"network.":[29,116],"Accordingly,":[30],"algorithms":[34],"for":[35,78,114,213,228,253,342,347],"generating":[36],"(i)":[37],"k":[38,48,52,93,97,108,122,131,145],"shortest":[39],"specified":[43,173,196],"pair,":[46],"(ii)":[47],"Spanning":[49,74,94,109,123,137,156],"trees,":[50,54,124,138],"(iii)":[51],"Steiner":[53,191,215,232,257,288,297,324],"etc.":[55],"are":[56],"used":[57,341],"in":[58,105,184,234],"literature.":[60],"However,":[61,162],"any":[62,343],"network":[63,81],"G":[64],"=":[65,265,269],"(V,":[66],"E)":[67],"will":[68,102,179],"have":[69],"specific":[71],"Trees.":[75],"Suppose":[76],"that":[77,130,144,335],"given":[80],"this":[82,185,203,246],"is":[84,140,205,226,316],"p.":[85,133],"case":[87,135,186],"if":[88,163],"attempts":[90],"create":[92,190],"Trees":[95,157,233,258,298],"where":[96],">":[98],"p,":[99,147],"effort":[101],"end":[103],"up":[104],"failure,":[106],"as":[107,148,183],"do":[111],"not":[112,180,345],"exist":[113],"Thus,":[117],"before":[118],"embarking":[119],"creating":[121],"make":[128],"sure":[129],"<;":[132,146],"it":[139],"easy":[141],"verify":[143],"Cayley's":[149,177,211],"formula":[150,178,212,225,252],"provides":[151],"labeled":[155],"complete":[160,236,261,301,349],"graph.":[161],"wants":[165],"generate":[167],"only":[171,346],"subset":[174,197],"nodes,":[176],"be":[181,333,340],"helpful,":[182],"by":[193],"connecting":[194],"nodes.":[199,244,309],"The":[200,310],"goal":[201],"paper":[204],"counterpart":[209],"trees.":[216],"To":[217],"best":[219],"our":[221],"knowledge,":[222],"no":[223],"such":[224],"known":[227],"graph":[237,302],"with":[238,303],"n":[239,304],"and":[241,267,290,306,318],"p":[242,264,268,272,307],"terminal":[243,308],"paper,":[247],"we":[248,275],"first":[249,282,314],"provide":[250,276],"graph,":[262],"when":[263],"2":[266],"3.":[270],"For":[271],"\u2265":[273],"4":[274],"two":[277],"algorithms,":[278],"which":[280],"computes":[284],"Trees,":[289],"second":[292,320,337],"generates":[294,322],"complexity":[311],"algorithm":[315,321,338],"O(np)":[317],"Tree":[325],"every":[326],"O(n)":[327],"unit":[328],"delay.":[330],"It":[331],"may":[332],"noted":[334],"can":[339],"graphs,":[344],"graphs.":[350]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}