An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs
Keiichi Kaneko, Naoki Sawada · IEICE Transactions on Information and Systems · 2007
In this paper, we propose an algorithm that solves the node-to-node disjoint paths problem in n-burnt pancake graphs 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 3n + 4. We conducted a computer experiment for n = 2 to 100 to measure the average performance of our algorithm. The results show that the average time complexity is O(n3.0) and the maximum path length is 3n + 4.