Pairwise Disjoint Paths in Pancake Graphs
Naoki Sawada, Keiichi Kaneko, Shietung Peng · 2007
Disjoint paths problems have attracted much attention due to its numerous applications in fault-tolerant routing. The pairwise disjoint paths problem is one of them. In this paper, we propose an algorithm for the pairwise disjoint paths problem in an pancake graph. The algorithm can find k disjoint paths in an n-pancake graph where k les [n/2]. The k disjoint paths can be constructed in O(kn) time and the maximum path length is bounded by [5n/3] + 6.