Node disjoint path construction algorithm in the folded divide-and-swap cube
Abstract
The folded divide-and-swap cube FDSC n ( n = 2 d , d ≥ 1) is a new hypercube variant, which has many superior properties compared to the hypercube. FDSC n is suitable as a candidate topology for data center networks. In this article, we investigate the one-to-one node disjoint path problem of FDSC n . We first present an algorithm to construct a path between any two distinct nodes u and v based on the structural characteristics of FDSC n . Then we develop an algorithm to build d + 2 node disjoint paths between any two different nodes in FDSC n , and show that the maximum length of these paths shall not exceed n + 9.
Fields of Study & Subjects
Interconnection Networks and Systems
Complexity and Algorithms in Graphs
Advanced Optical Network Technologies
Publication details
- Journal / source
- PeerJ Computer Science
- Volume
- 12
- Pages
- e3458–e3458
- Publication date
- 27 January 2026
- Language
- EN