Results 1 to 10 of about 140,400 (132)
Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]
Jisuanji kexue, 2022 Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a ...
BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
doaj +1 more source
Algorithm to Construct Node-independent Spanning Trees in Data Center Network BCDC [PDF]
Jisuanji kexue, 2022 As the foundation of cloud computing technology,the communication performance of data center networks has become a research hotspot in recent years.And as an important infrastructure of data center networks,independent spanning trees(ISTs) attract much ...
PAN Zhi-yong, CHENG Bao-lei, FAN Jian-xi, BIAN Qing-rong
doaj +1 more source
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
IEEE Access, 2021 The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to ...
Dun-Wei Cheng +2 more
doaj +1 more source
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
IEEE Access, 2021 A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally ...
Yi-Cheng Yang +5 more
doaj +1 more source
Constructing Independent Spanning Trees on Transposition Networks
IEEE Access, 2020 In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks.
Chien-Fu Lin +2 more
doaj +1 more source
Dual Protection Routing Trees on Graphs
Mathematics, 2023 In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node
Kung-Jui Pai
doaj +1 more source
Constructing Independent Spanning Trees on Pancake Networks
IEEE Access, 2020 For any graph G, the set of independent spanning trees (ISTs) is defined as the set of spanning trees in G. All ISTs have the same root, paths from the root to another vertex between distinct trees are vertex-disjoint and edge-disjoint.
Dun-Wei Cheng +2 more
doaj +1 more source
Conditions for Implicit-Degree Sum for Spanning Trees with Few Leaves in K1,4-Free Graphs
Mathematics, 2023 A graph with n vertices is called an n-graph. A spanning tree with at most k leaves is referred to as a spanning k-ended tree. Spanning k-ended trees are important in various fields such as network design, graph theory, and communication networks.
Junqing Cai +3 more
doaj +1 more source
Two Algorithms for Constructing Independent Spanning Trees in (
IEEE Access, 2020 In a graph $G$ , two spanning trees $T_{1}$ and $T_{2}$ are rooted at the same vertex $r$ . If, for every $v \in V(G)$ , the paths from $v$ to the root $r$ in $T_{1}$ and $T_{2}$ are internally vertex-disjoint, they are called independent ...
Jie-Fu Huang +2 more
doaj +1 more source
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
IEEE Access, 2020 A set of spanning trees in a graph G is called independent spanning trees (ISTs) if they are rooted at the same vertex r, and for each vertex v(≠ r) in G, the two paths from v to r in any two trees share no common vertex expect for v and r.
Jie-Fu Huang +3 more
doaj +1 more source