PAPER Special Issue on Parallel and Distributed Computing, Applications and Technologies Node-to-Set Disjoint Paths Problem in Pancake Graphs

SUMMARY In this paper, we give an algorithm for the nodeto-set disjoint paths problem in pancake graphs with its evaluation results. The algorithm is of polynomial order of n for an n-pancake graph. It is based on recursion and divided into two cases according to the distribution of destination nodes in classes into which all the nodes in a pancake graph are categorized. The sum of lengths of paths obtained and the time complexityof the algorithm are estimated and the average performance is evaluated based on computer simulation.