2025/12/23 by Jun Yuan, Shan Liu, Yuan, Jun +5
Computer Science · Engineering · #Advanced Optical Network Technologies #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Interconnection Networks and Systems
paper · doi:10.48550/arxiv.2512.19973
openalex publication_date 2025/12/23 · openalex created_date 2025/12/25 · openalex updated_date 2026/07/28
The S-Steiner tree packing problem provides mathematical foundations for optimizing multi-path information transmission, particularly in designing fault-tolerant parallelized routing architectures for massive-scale network infrastructures. In this article, we propose the definitions of completely independent S-Steiner trees (CISSTs for short) and generalized k^*-connectivity, which generalize the definitions of internally disjoint S-Steiner trees and generalized k-connectivity. Given a connected graph G = (V,E) and a vertex subset S⊆ V, |S|≥ 2, an S-Steiner tree of G is a subtree in G that spans all nodes in S. The S-Steiner trees T1,T2,⋯, Tk of G are completely independent pairwise if for any 1≤ p