Node-to-Set Disjoint Paths Problem in Pancake Graphs(Special Issue on Parallel and Distributed Computing, Applications and technologies)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we give an algorithm for the node-to-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 complexity of the algorithm are estimated and the average performance is evaluated based on computer simulation.
- 社団法人電子情報通信学会の論文
- 2003-09-01
著者
-
Kaneko K
Faculty Of Technology Tokyo University Of Agriculture And Technology
-
Kaneko Keiichi
Faculty Of Technology Tokyo University Of Agriculture And Technology
-
SUZUKI Yasuto
Faculty of Technology, Tokyo University of Agriculture and Technology
-
Suzuki Y
Faculty Of Technology Tokyo University Of Agriculture And Technology
-
Suzuki Yasuto
Faculty Of Technology Tokyo University Of Agriculture And Technology
関連論文
- Internally-Disjoint Paths Problem in Bi-Rotator Graphs(Dependable Computing)
- Node-to-Set Disjoint Paths Problem in Pancake Graphs(Special Issue on Parallel and Distributed Computing, Applications and technologies)
- Node-Disjoint Paths Algorithm in a Transposition Graph(Algorithm Theory)
- An Algorithm for Node-Disjoint Paths in Pancake Graphs
- Minimum Feedback Node Sets in Trivalent Cayley Graphs(Special Issue on Parallel and Distributed Computing, Applications and technologies)
- Fault-Tolerant Routing Algorithms for Hypercube Interconnection Networks
- An Algorithm for Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs(Dependable Communication)(Dependable Computing)