A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the problem of sorting burnt pancakes
Discrete Applied Mathematics
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Comparing star and pancake networks
The essence of computation
An algorithm for disjoint paths in bubble-sort graphs
Systems and Computers in Japan
Internally-Disjoint Paths Problem in Bi-Rotator Graphs
IEICE - Transactions on Information and Systems
Node-Disjoint Paths Algorithm in a Transposition Graph
IEICE - Transactions on Information and Systems
An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs
IEICE - Transactions on Information and Systems
Disjoint Paths Routing in Pancake Graphs
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs
IEICE - Transactions on Information and Systems
The Container Problem in Bubble-Sort Graphs
IEICE - Transactions on Information and Systems
Fault-tolerant routing in burnt pancake graphs
Information Processing Letters
A topological property of hypercubes: node disjoint paths
SPDP '90 Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing
Three disjoint path paradigms in star networks
SPDP '91 Proceedings of the 1991 Third IEEE Symposium on Parallel and Distributed Processing
| Hi-index | 0.00 |
In this paper, we propose an algorithm that solves the k-pariwise disjoint path problem in an n-burnt pancake graph where n ≥ 4 and k = [n/2] in polynomial-order time of n. We also give a proof of its correctness as well as the estimates of time complexity O(n3) and the maximum path length 2n + 9.