An Algorithm for Node-Disjoint Paths in Pancake Graphs
スポンサーリンク
概要
- 論文の詳細を見る
For any pair of distinct nodes in an n-pancake graph, we give an algorithm for construction of n - 1 internally disjoint paths connecting the nodes in the time complexity of polynomial order of n. The length of each path obtained and the time complexity of the algorithm are estimated theoretically and verified by computer simulation.
- 社団法人電子情報通信学会の論文
- 2003-03-01
著者
-
Kaneko Keiichi
Faculty Of Technology Tokyo University Of Agriculture And Technology
-
SUZUKI Yasuto
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)