Communications of the ACM - Special section on computer architecture
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
A unified approach to off-line permutation routing on parallel networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Node-to-set disjoint paths problem in star graphs
Information Processing Letters
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Transposition Networks as a Class of Fault-Tolerant Robust Networks
IEEE Transactions on Computers
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
An algorithm for disjoint paths in bubble-sort graphs
Systems and Computers in Japan
A routing algorithm of pairwise disjoint paths in a burnt pancake graph
Proceedings of the Second Symposium on Information and Communication Technology
| Hi-index | 0.00 |
Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.