{"id":"https://openalex.org/W7155404354","doi":"https://doi.org/10.48550/arxiv.2604.19886","title":"Completely Independent Steiner Trees","display_name":"Completely Independent Steiner Trees","publication_year":2026,"publication_date":"2026-04-21","ids":{"openalex":"https://openalex.org/W7155404354","doi":"https://doi.org/10.48550/arxiv.2604.19886"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.19886","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.19886","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.19886","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134437489","display_name":"Anil Maheshwari","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maheshwari, Anil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112881407","display_name":"Karthik Murali","orcid":"https://orcid.org/0009-0003-3985-3609"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Murali, Karthik","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Smid, Michiel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.854200005531311,"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.854200005531311,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.06849999725818634,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.03669999912381172,"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8996000289916992},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.7569000124931335},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6177999973297119},{"id":"https://openalex.org/keywords/tr\u00e9maux-tree","display_name":"Tr\u00e9maux tree","score":0.5141000151634216},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.42669999599456787},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.39959999918937683},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.39629998803138733},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.37470000982284546}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8996000289916992},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.847100019454956},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7569000124931335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7170000076293945},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6177999973297119},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5401999950408936},{"id":"https://openalex.org/C124302570","wikidata":"https://www.wikidata.org/wiki/Q7849146","display_name":"Tr\u00e9maux tree","level":5,"score":0.5141000151634216},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.42669999599456787},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.39959999918937683},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.39629998803138733},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.37470000982284546},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3540000021457672},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.3452000021934509},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.26899999380111694},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.25220000743865967},{"id":"https://openalex.org/C175695255","wikidata":"https://www.wikidata.org/wiki/Q4420916","display_name":"Steiner system","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.19886","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.19886","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.19886","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.19886","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Spanning":[0],"trees":[1,19,39,62,81,104,134,151,164,179,225],"are":[2,63,152],"fundamental":[3],"for":[4,139],"efficient":[5],"communication":[6],"in":[7,107,147],"networks.":[8],"For":[9,74],"fault-tolerant":[10],"communication,":[11],"it":[12],"is":[13,92,135],"desirable":[14],"to":[15,20,65,85,199],"have":[16,40,56],"multiple":[17],"spanning":[18,38,49,80,121,163,224],"ensure":[21],"resilience":[22],"against":[23],"failures":[24],"of":[25,34,70,78,95,118,132,142,175,209,221],"nodes":[26],"and":[27,46,155,165,183,197,207],"edges.":[28],"To":[29],"this":[30,111],"end,":[31],"various":[32],"notions":[33],"disjoint":[35,97,167],"or":[36],"independent":[37,48,120,127,137,162,177,223,231],"been":[41,58,83],"studied,":[42],"including":[43],"edge-disjoint,":[44],"node/edge-independent,":[45],"completely":[47,119,136,161,176,222,230],"trees.":[50,169,233],"Alongside":[51],"these,":[52],"several":[53,190],"Steiner":[54,87,98,103,116,128,133,150,168,178,232],"variants":[55],"also":[57,216],"investigated,":[59],"where":[60,100],"the":[61,76,93,108,115,145,149,213],"required":[64],"span":[66],"a":[67,89,172,218],"designated":[68],"subset":[69],"vertices":[71],"called":[72],"terminals.":[73,109],"instance,":[75],"study":[77,174],"edge-disjoint":[79,86],"has":[82],"extended":[84],"trees;":[88],"stronger":[90],"variant":[91,220],"problem":[94],"internally":[96,153,166],"trees,":[99,122],"any":[101],"two":[102],"intersect":[105],"exactly":[106],"In":[110,186],"paper,":[112],"we":[113,124,188,215],"investigate":[114],"analogue":[117],"which":[123],"call":[125],"\\emph{completely":[126],"trees}.":[129],"A":[130],"set":[131],"if,":[138],"every":[140],"pair":[141],"terminals":[143],"$u,v$,":[144],"$(u,v)$-paths":[146],"all":[148],"vertex-disjoint":[154],"edge-disjoint.":[156],"This":[157],"notion":[158],"generalizes":[159],"both":[160],"We":[170],"provide":[171],"systematic":[173],"from":[180],"structural,":[181],"algorithmic,":[182],"complexity-theoretic":[184],"perspectives.":[185],"particular,":[187],"present":[189],"characterisations,":[191],"connectivity":[192],"bounds,":[193],"algorithms,":[194],"hardness":[195],"results,":[196],"applications":[198],"special":[200],"graph":[201],"classes":[202],"such":[203],"as":[204],"planar":[205],"graphs":[206,208],"bounded":[210],"treewidth.":[211],"Along":[212],"way,":[214],"introduce":[217],"directed":[219],"via":[226],"an":[227],"equivalence":[228],"with":[229]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-24T00:00:00"}