An adaptive stabilizing algorithm for finding all disjoint paths in anonymous mesh networks
Computer Communications
| Hi-index | 0.00 |
Disjoint paths problems have attracted much atten- tion 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 n/2 . The k disjoint paths can be constructed in O(kn) time and the maximum path length is bounded by 5n/3 + 6. Keywords: interconnection networks, polynomial time algorithm, disjoint paths.