Results 1 to 10 of about 139,124 (158)
Completely Independent Spanning Trees in (Partial) k-Trees
Discussiones Mathematicae Graph Theory, 2015 Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint.
Matsushita Masayoshi +2 more
doaj +3 more sources
Constructing Independent Spanning Trees on Pancake Networks [PDF]
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 +2 more sources
Constructing Independent Spanning Trees on Transposition Networks [PDF]
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 +2 more sources
Completely Independent Spanning Trees in k-Th Power of Graphs
Discussiones Mathematicae Graph Theory, 2018 Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj +2 more sources
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
Independent spanning trees in Eisenstein–Jacobi networks [PDF]
The Journal of Supercomputing, 2022 Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applications. Examples are cellular networks, computer graphics, and image processing. Eisenstein-Jacobi (EJ) networks are a generalization of hexagonal mesh topology.
Zaid Hussain +2 more
openaire +2 more sources
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
Four Edge-Independent Spanning Trees [PDF]
SIAM Journal on Discrete Mathematics, 2018 22 pages, 4 figures. Presented at the 29th Cumberland Conference on Combinatorics, Graph Theory and Computing at Vanderbilt ...
Hoyer, Alexander, Thomas, Robin
openaire +2 more sources
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