Title :
Pairwise Disjoint Paths in Pancake Graphs
Author :
Sawada, Naomi ; Kaneko, Kunihiko
Author_Institution :
Tokyo Univ. of Agric. & Technol., Tokyo
Abstract :
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.
Keywords :
communication complexity; graph theory; network theory (graphs); fault-tolerant routing; pairwise disjoint paths; pancake graphs; Agricultural engineering; Agriculture; Application software; Concurrent computing; Distributed computing; Fault tolerance; Multiprocessor interconnection networks; Network topology; Polynomials; Routing;
Conference_Titel :
Parallel and Distributed Computing, Applications and Technologies, 2007. PDCAT '07. Eighth International Conference on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7695-3049-4
DOI :
10.1109/PDCAT.2007.85
