The divide-and-swap cube: a new hypercube variant with small network cost

Kim, Jong-Seok; Kim, Dong-Hyun; Qiu, Ke; Lee, Hyeong-Ok

doi:10.1007/s11227-018-2712-z

Cited by 12 publications

(2 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The n-dimensional divide-and-swap cube, denoted by DSC n (n = 2 d , d ≥ 1), was proposed by Kim et al in [18] as a hypercube variant. Compared with a hypercube, DSC n reduces the network cost from O(n 2 ) to O(n log 2 n).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Super Spanning Connectivity of the Folded Divide-and-SwapCube

2023

View full text Add to dashboard Cite

A k*-container of a graph G is a set of k disjoint paths between any pair of nodes whose union covers all nodes of G. The spanning connectivity of G, κ*(G), is the largest k, such that there exists a j*-container between any pair of nodes of G for all 1≤j≤k. If κ*(G)=κ(G), then G is super spanning connected. Spanning connectivity is an important property to measure the fault tolerance of an interconnection network. The divide-and-swap cube DSCn is a newly proposed hypercube variant, which reduces the network cost from O(n2) to O(nlog2n) compared with the hypercube and other hypercube variants. The folded divide-and-swap cube FDSCn is proposed based on DSCn to reduce the diameter of DSCn. Both DSCn and FDSCn possess many better properties than hypercubes. In this paper, we investigate the super spanning connectivity of FDSCn where n=2d and d≥1. We show that κ*(FDSCn)=κ(FDSCn)=d+2, which means there exists an m-DPC(node-disjoint path cover) between any pair of nodes in FDSCn for all 1≤m≤d+2.

show abstract

Section: Introductionmentioning

confidence: 99%

“…The n-dimensional folded divide-and-swap cube, FDSC n (n = 2 d , d ≥ 1), was also proposed in [18]. FDSC n is constructed based on DSC n by adding one edge to each node of DSC n .…”

Section: Introductionmentioning

confidence: 99%