| Budget Amount *help |
¥4,420,000 (Direct Cost: ¥3,400,000、Indirect Cost: ¥1,020,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,820,000 (Direct Cost: ¥1,400,000、Indirect Cost: ¥420,000)
Fiscal Year 2013: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
First, to investigate the properties of Cayley graphs, this project developed the algorithms that solves various problems related to disjoint paths in a Mobius cube, a hypercube, a hierarchical hypercube, and a hyper-star graph. Next, the project developed the fault-tolerant routing algorithms based on restricted global information in a burnt pancake graph, a dual cube, a pancake graph, an (n,k)-star graph, a hyper-star graph. Finally, this project developed the stochastic fault-tolerant routing algorithms in a hypercube and a hyper-star graph, and it extended them to be link-fault-tolerant.
|
