| Presentation | 2005/7/29 An Algorithm for Node-Disjoint Paths Problem in Burnt Pancake Graphs Naoki SAWADA, Yasuto SUZUKI, Keiichi KANEKO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | An n-burnt pancake graph B_n[1] is an undirected regular graph with n!×2^n nodes and degree n. The burnt pancake graphs is an attractive as a topology of interconnection networks. Because the density of B_n is higher than that of hypercube and B_n can interconnect different numbers of nodes from the pancake graphs, the star graphs and the rotator graphs. In this study, we take an n-burnt pancake graph as a target and propose an algorithm to obtain, for any pair of nodes, n internally disjoint paths between them in the time complexity of polynomial order of the degree. We also show that the time complexity and the max length of a path given by the algorithm is O(n^3) and 3n+4, respectively. The simulation results show that the average time complexity of the altorithm and the max length of a path given by the algorithm are of O(n^<2.6>) and 3n+4, respectively. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | burnt pancake graph / disjoint paths / fault tolerance / polynomial-order algorithm |
| Paper # | DC2005-13 |
| Date of Issue |
| Conference Information | |
| Committee | DC |
|---|---|
| Conference Date | 2005/7/29(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Dependable Computing (DC) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Algorithm for Node-Disjoint Paths Problem in Burnt Pancake Graphs |
| Sub Title (in English) | |
| Keyword(1) | burnt pancake graph |
| Keyword(2) | disjoint paths |
| Keyword(3) | fault tolerance |
| Keyword(4) | polynomial-order algorithm |
| 1st Author's Name | Naoki SAWADA |
| 1st Author's Affiliation | Department of Technology, Tokyo University of Agriculture and Technology() |
| 2nd Author's Name | Yasuto SUZUKI |
| 2nd Author's Affiliation | Department of Technology, Tokyo University of Agriculture and Technology |
| 3rd Author's Name | Keiichi KANEKO |
| 3rd Author's Affiliation | Department of Technology, Tokyo University of Agriculture and Technology |
| Date | 2005/7/29 |
| Paper # | DC2005-13 |
| Volume (vol) | vol.105 |
| Number (no) | 227 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |