Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
نویسندگان
چکیده
منابع مشابه
Node-Independent Spanning Trees in Gaussian Networks
Gaussian network is known to be an alternative to toroidal network since it has the same number of nodes with less diameter, which makes it perform better than toroidal network. Spanning trees are said to be independent if all trees are rooted at the same node r and for any other node u, the nodes of the paths from r to u in all trees are distinct except the nodes r and u. In this paper, we inv...
متن کاملConstruction independent spanning trees on locally twisted cubes in parallel
Let LTQn denote the n-dimensional locally twisted cube. Hsieh and Tu (2009) [13] presented an algorithm to construct n edge-disjoint spanning trees rooted at vertex 0 in LTQn. Later on, Lin et al. (2010) [23] proved that Hsieh and Tu’s spanning trees are indeed independent spanning trees (ISTs for short), i.e., all spanning trees are rooted at the same vertex r and for any other vertex v(6= r),...
متن کاملParallel construction of optimal independent spanning trees on hypercubes
The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Tang et al. [S.-M. Tang, Y.-L. Wang, Y.-H. Leu, Optimal independent spanning trees on hypercubes, Journal of Information S...
متن کاملCompletely Independent Spanning Trees in Some Regular Networks
Let k ≥ 2 be an integer and T1, . . . , Tk be spanning trees of a graph G.If for any pair of vertices (u, v) of V (G), the paths from u to v in each Ti,1 ≤ i ≤ k, do not contain common edges and common vertices, except thevertices u and v, then T1, . . . , Tk are completely independent spanningtrees in G. For 2k-regular graphs which are 2k-connected, such as theCartesian pro...
متن کاملTop-Down Construction and Repetetive Structures Representation in Bayesian Networks
Bayesian networks for large and complex domains are difficult to construct and maintain. For example modifying a small network fragment in a repetitive structure might be very time consuming. Top-down modelling may simplify the construction of large Bayesian networks, but methods (partly) supporting top-down modelling have only recently been introduced and tools do not exist. In this paper, we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2999421