Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs

Authors:
Keiichi Kaneko;Yasuto Suzuki
Affiliations:
-;-
Venue:
PRDC '04 Proceedings of the 10th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC'04)
Year:
2004

Citing 0
Cited 3

Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs

Information Processing Letters
Hamiltonian laceability of bubble-sort graphs with edge faults

Information Sciences: an International Journal
Fault tolerance in bubble-sort graph networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A bubble-sort graph is a variant of Cayley graphs and it is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on nth bubble-sort graphs and propose an algorithm to obtain n - 1 disjoint paths between arbitrary two nodes in the complexity of polynomial order of n which is the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of path lengths afterproving the correctness of the algorithm. Moreover, we report the results of computer experiment to evaluate average performance of the algorithm.