| Budget Amount *help |
¥3,120,000 (Direct Cost: ¥2,400,000、Indirect Cost: ¥720,000)
Fiscal Year 2011: ¥1,495,000 (Direct Cost: ¥1,150,000、Indirect Cost: ¥345,000)
Fiscal Year 2010: ¥1,625,000 (Direct Cost: ¥1,250,000、Indirect Cost: ¥375,000)
|
|---|
| Research Abstract |
Although algorithms based on the graph minor theory run in polynomial time, they are theoretically and practically far from efficient algorithms. In this research, we gave a faster algorithm for the disjoint paths problem with a fixed number of terminal pairs, which improves the running time from O(n^3) to O(n^2),where n is the number of the input graph. Furthermore, we gave a simpler and faster algorithm for some problems if the input graph is in restricted classes.
|
