A Parallel Construction of Vertex-Disjoint Spanning Trees with Optimal Heights in Star Networks

Kao, Shih-Shun; Chang, Jou–Ming; Pai, Kung-Jui; Yang, Jinn‐Shyong; Tang, Shyue-Ming; Wu, Ro-Yu

doi:10.1007/978-3-319-71150-8_4

Cited by 3 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Numerous studies have been published regarding different types of hypercubes; in particular, star graphs can be used for constructing ISTs on different types of Cayley graphs [16]. We focus on constructing ISTs on different graphs [5], [6], [11]- [13], [18]; the emphasis is how to determine different independent paths from vertex v to the root vertex [10], [17]. We consider that an algorithm is fully parallelized if uses all network vertices for computation [5], [18].…”

Section: Introductionmentioning

confidence: 99%

Constructing Independent Spanning Trees on Pancake Networks

2020

View full text Add to dashboard Cite

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. The construction of multiple independent trees on a graph has numerous applications, such as fault-tolerant broadcasting and secure message distribution. The pancake graph is a subclass of Cayley graphs and since Cayley graphs are crucial for designing interconnection networks, constructing ISTs on these graphs is necessary for many practical applications. In this paper, we propose algorithms for constructing ISTs on pancake graph. Examine the use of our algorithm for constructing ISTs on pancake graph in different dimensions. We also present proofs about the construction of ISTs on pancake graph to verify that the correctness of these algorithms.INDEX TERMS Interconnection networks, independent spanning trees, pancake networks.

show abstract

Section: Introductionmentioning

confidence: 99%

Constructing Independent Spanning Trees on Pancake Networks

2020

View full text Add to dashboard Cite

show abstract

“…In the past twenty years, the IST problem has been solved on several interconnection networks, including chordal rings [15], twisted cubes [3], [27], cross cubes [7], Möbius cubes [8], locally twisted cubes [5], [12], [23], parity cubes [4], [26], hypercubes [28], [30], folded hypercubes [32], star networks [17], Gaussian networks [13], bubble-sort networks [18], [19], and recursive circulant graphs with G(cd m , d) with d > 2 [31].…”

Section: Introductionmentioning

confidence: 99%

Constructing Independent Spanning Trees on Transposition Networks

2020

View full text Add to dashboard Cite

In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection node fails, users want to reconnect as rapidly as possible, it is urgently in need to construct a new path. Thus, searching node-disjoint paths is crucial for finding a new path in networks. In this article, we expand the target to construct independent spanning trees to maximize the fault tolerance of transposition networks.INDEX TERMS Independent spanning trees, transposition networks, interconnection networks, Cayley graphs.

show abstract